./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-regression/rule57_ebda_blast.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-regression/rule57_ebda_blast.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 87a050a9ba88ec48bac6e38316d21dd54013b685d199047e34008aa0aba79e8c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:49:41,347 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:49:41,349 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:49:41,389 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:49:41,390 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:49:41,393 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:49:41,395 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:49:41,398 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:49:41,400 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:49:41,405 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:49:41,406 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:49:41,408 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:49:41,408 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:49:41,411 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:49:41,412 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:49:41,414 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:49:41,415 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:49:41,415 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:49:41,419 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:49:41,424 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:49:41,426 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:49:41,427 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:49:41,429 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:49:41,430 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:49:41,436 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:49:41,436 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:49:41,437 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:49:41,439 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:49:41,439 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:49:41,440 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:49:41,441 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:49:41,442 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:49:41,443 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:49:41,444 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:49:41,445 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:49:41,446 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:49:41,446 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:49:41,447 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:49:41,447 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:49:41,448 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:49:41,448 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:49:41,450 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:49:41,487 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:49:41,487 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:49:41,488 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:49:41,488 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:49:41,489 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:49:41,489 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:49:41,490 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:49:41,490 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:49:41,491 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:49:41,491 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:49:41,492 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:49:41,492 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:49:41,492 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:49:41,492 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:49:41,493 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:49:41,493 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:49:41,493 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:49:41,493 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:49:41,494 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:49:41,494 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:49:41,494 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:49:41,494 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:49:41,494 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:49:41,495 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:49:41,495 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:49:41,495 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:49:41,495 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:49:41,497 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:49:41,497 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:49:41,497 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:49:41,497 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:49:41,498 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:49:41,498 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:49:41,498 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 87a050a9ba88ec48bac6e38316d21dd54013b685d199047e34008aa0aba79e8c [2022-02-20 16:49:41,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:49:41,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:49:41,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:49:41,786 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:49:41,787 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:49:41,788 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/rule57_ebda_blast.i [2022-02-20 16:49:41,856 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7c6ff881/da883a198cc54ca1bdb66d052a826977/FLAG1899cb128 [2022-02-20 16:49:42,290 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:49:42,290 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/rule57_ebda_blast.i [2022-02-20 16:49:42,300 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7c6ff881/da883a198cc54ca1bdb66d052a826977/FLAG1899cb128 [2022-02-20 16:49:42,690 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7c6ff881/da883a198cc54ca1bdb66d052a826977 [2022-02-20 16:49:42,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:49:42,695 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:49:42,699 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:49:42,699 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:49:42,702 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:49:42,703 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:49:42" (1/1) ... [2022-02-20 16:49:42,705 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@623c6eaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:42, skipping insertion in model container [2022-02-20 16:49:42,705 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:49:42" (1/1) ... [2022-02-20 16:49:42,712 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:49:42,732 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:49:42,872 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/rule57_ebda_blast.i[299,312] [2022-02-20 16:49:42,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:49:42,942 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:49:42,955 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/rule57_ebda_blast.i[299,312] [2022-02-20 16:49:42,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:49:43,001 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:49:43,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:43 WrapperNode [2022-02-20 16:49:43,003 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:49:43,004 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:49:43,004 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:49:43,004 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:49:43,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:43" (1/1) ... [2022-02-20 16:49:43,033 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:43" (1/1) ... [2022-02-20 16:49:43,069 INFO L137 Inliner]: procedures = 24, calls = 25, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 99 [2022-02-20 16:49:43,069 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:49:43,070 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:49:43,070 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:49:43,070 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:49:43,078 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:43" (1/1) ... [2022-02-20 16:49:43,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:43" (1/1) ... [2022-02-20 16:49:43,081 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:43" (1/1) ... [2022-02-20 16:49:43,081 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:43" (1/1) ... [2022-02-20 16:49:43,088 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:43" (1/1) ... [2022-02-20 16:49:43,090 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:43" (1/1) ... [2022-02-20 16:49:43,092 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:43" (1/1) ... [2022-02-20 16:49:43,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:49:43,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:49:43,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:49:43,095 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:49:43,096 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:43" (1/1) ... [2022-02-20 16:49:43,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:49:43,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:49:43,136 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:49:43,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:49:43,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 16:49:43,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:49:43,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:49:43,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 16:49:43,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:49:43,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 16:49:43,172 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-02-20 16:49:43,172 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-02-20 16:49:43,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:49:43,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:49:43,291 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:49:43,292 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:49:43,607 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:49:43,614 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:49:43,614 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 16:49:43,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:49:43 BoogieIcfgContainer [2022-02-20 16:49:43,616 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:49:43,618 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:49:43,618 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:49:43,621 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:49:43,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:49:42" (1/3) ... [2022-02-20 16:49:43,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ad238df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:49:43, skipping insertion in model container [2022-02-20 16:49:43,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:43" (2/3) ... [2022-02-20 16:49:43,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ad238df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:49:43, skipping insertion in model container [2022-02-20 16:49:43,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:49:43" (3/3) ... [2022-02-20 16:49:43,624 INFO L111 eAbstractionObserver]: Analyzing ICFG rule57_ebda_blast.i [2022-02-20 16:49:43,629 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:49:43,630 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:49:43,695 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:49:43,711 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:49:43,712 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:49:43,739 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:49:43,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:49:43,744 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:49:43,744 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:49:43,745 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:49:43,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:49:43,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1648817827, now seen corresponding path program 1 times [2022-02-20 16:49:43,758 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:49:43,758 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350317796] [2022-02-20 16:49:43,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:49:43,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:49:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:44,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:49:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:44,159 INFO L290 TraceCheckUtils]: 0: Hoare triple {44#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;call #t~malloc4#1.base, #t~malloc4#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc4#1.base, #t~malloc4#1.offset, 1, ~size#1, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {45#(or (<= (+ |kzalloc_#t~malloc4#1.base| 1) 0) (not (<= |kzalloc_#t~malloc4#1.base| 0)))} is VALID [2022-02-20 16:49:44,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(or (<= (+ |kzalloc_#t~malloc4#1.base| 1) 0) (not (<= |kzalloc_#t~malloc4#1.base| 0)))} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc4#1.base, #t~malloc4#1.offset; {46#(or (<= 1 |kzalloc_#res#1.base|) (<= (+ |kzalloc_#res#1.base| 1) 0))} is VALID [2022-02-20 16:49:44,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {46#(or (<= 1 |kzalloc_#res#1.base|) (<= (+ |kzalloc_#res#1.base| 1) 0))} assume true; {46#(or (<= 1 |kzalloc_#res#1.base|) (<= (+ |kzalloc_#res#1.base| 1) 0))} is VALID [2022-02-20 16:49:44,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46#(or (<= 1 |kzalloc_#res#1.base|) (<= (+ |kzalloc_#res#1.base| 1) 0))} {36#true} #77#return; {42#(not (= |ULTIMATE.start_ebda_rsrc_controller_#t~ret8#1.base| 0))} is VALID [2022-02-20 16:49:44,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~tmp_slot~0.base, ~tmp_slot~0.offset := 0, 0;~used_tmp_slot~0 := 0;~freed_tmp_slot~0 := 1; {36#true} is VALID [2022-02-20 16:49:44,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1;assume { :begin_inline_ebda_rsrc_controller } true;havoc ebda_rsrc_controller_#res#1;havoc ebda_rsrc_controller_#t~ret8#1.base, ebda_rsrc_controller_#t~ret8#1.offset, ebda_rsrc_controller_#t~ret9#1.base, ebda_rsrc_controller_#t~ret9#1.offset, ebda_rsrc_controller_#t~ret10#1.base, ebda_rsrc_controller_#t~ret10#1.offset, ebda_rsrc_controller_#t~ret11#1, ebda_rsrc_controller_#t~ret12#1, ebda_rsrc_controller_#t~mem13#1.base, ebda_rsrc_controller_#t~mem13#1.offset, ebda_rsrc_controller_~hp_slot_ptr~0#1.base, ebda_rsrc_controller_~hp_slot_ptr~0#1.offset, ebda_rsrc_controller_~bus_info_ptr1~0#1.base, ebda_rsrc_controller_~bus_info_ptr1~0#1.offset, ebda_rsrc_controller_~rc~0#1;havoc ebda_rsrc_controller_~hp_slot_ptr~0#1.base, ebda_rsrc_controller_~hp_slot_ptr~0#1.offset;havoc ebda_rsrc_controller_~bus_info_ptr1~0#1.base, ebda_rsrc_controller_~bus_info_ptr1~0#1.offset;havoc ebda_rsrc_controller_~rc~0#1; {36#true} is VALID [2022-02-20 16:49:44,169 INFO L272 TraceCheckUtils]: 2: Hoare triple {36#true} call ebda_rsrc_controller_#t~ret8#1.base, ebda_rsrc_controller_#t~ret8#1.offset := kzalloc(8, 1); {44#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:49:44,172 INFO L290 TraceCheckUtils]: 3: Hoare triple {44#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;call #t~malloc4#1.base, #t~malloc4#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc4#1.base, #t~malloc4#1.offset, 1, ~size#1, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {45#(or (<= (+ |kzalloc_#t~malloc4#1.base| 1) 0) (not (<= |kzalloc_#t~malloc4#1.base| 0)))} is VALID [2022-02-20 16:49:44,173 INFO L290 TraceCheckUtils]: 4: Hoare triple {45#(or (<= (+ |kzalloc_#t~malloc4#1.base| 1) 0) (not (<= |kzalloc_#t~malloc4#1.base| 0)))} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc4#1.base, #t~malloc4#1.offset; {46#(or (<= 1 |kzalloc_#res#1.base|) (<= (+ |kzalloc_#res#1.base| 1) 0))} is VALID [2022-02-20 16:49:44,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {46#(or (<= 1 |kzalloc_#res#1.base|) (<= (+ |kzalloc_#res#1.base| 1) 0))} assume true; {46#(or (<= 1 |kzalloc_#res#1.base|) (<= (+ |kzalloc_#res#1.base| 1) 0))} is VALID [2022-02-20 16:49:44,176 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {46#(or (<= 1 |kzalloc_#res#1.base|) (<= (+ |kzalloc_#res#1.base| 1) 0))} {36#true} #77#return; {42#(not (= |ULTIMATE.start_ebda_rsrc_controller_#t~ret8#1.base| 0))} is VALID [2022-02-20 16:49:44,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#(not (= |ULTIMATE.start_ebda_rsrc_controller_#t~ret8#1.base| 0))} ebda_rsrc_controller_~hp_slot_ptr~0#1.base, ebda_rsrc_controller_~hp_slot_ptr~0#1.offset := ebda_rsrc_controller_#t~ret8#1.base, ebda_rsrc_controller_#t~ret8#1.offset;havoc ebda_rsrc_controller_#t~ret8#1.base, ebda_rsrc_controller_#t~ret8#1.offset; {43#(not (= |ULTIMATE.start_ebda_rsrc_controller_~hp_slot_ptr~0#1.base| 0))} is VALID [2022-02-20 16:49:44,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {43#(not (= |ULTIMATE.start_ebda_rsrc_controller_~hp_slot_ptr~0#1.base| 0))} assume ebda_rsrc_controller_~hp_slot_ptr~0#1.base == 0 && ebda_rsrc_controller_~hp_slot_ptr~0#1.offset == 0;ebda_rsrc_controller_~rc~0#1 := -2; {37#false} is VALID [2022-02-20 16:49:44,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#false} ebda_rsrc_controller_#res#1 := ebda_rsrc_controller_~rc~0#1; {37#false} is VALID [2022-02-20 16:49:44,179 INFO L290 TraceCheckUtils]: 10: Hoare triple {37#false} main_#t~ret14#1 := ebda_rsrc_controller_#res#1;assume { :end_inline_ebda_rsrc_controller } true;assume -2147483648 <= main_#t~ret14#1 && main_#t~ret14#1 <= 2147483647;havoc main_#t~ret14#1; {37#false} is VALID [2022-02-20 16:49:44,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {37#false} assume 0 == ~used_tmp_slot~0; {37#false} is VALID [2022-02-20 16:49:44,180 INFO L290 TraceCheckUtils]: 12: Hoare triple {37#false} assume !(0 != ~freed_tmp_slot~0);assume { :begin_inline___blast_assert } true; {37#false} is VALID [2022-02-20 16:49:44,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-02-20 16:49:44,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:49:44,182 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:49:44,183 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350317796] [2022-02-20 16:49:44,183 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350317796] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:49:44,184 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:49:44,184 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 16:49:44,185 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247692468] [2022-02-20 16:49:44,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:49:44,192 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-02-20 16:49:44,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:49:44,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:49:44,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:44,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:49:44,218 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:49:44,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:49:44,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:49:44,244 INFO L87 Difference]: Start difference. First operand has 33 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:49:44,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:44,526 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2022-02-20 16:49:44,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:49:44,526 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-02-20 16:49:44,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:49:44,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:49:44,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2022-02-20 16:49:44,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:49:44,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2022-02-20 16:49:44,539 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 52 transitions. [2022-02-20 16:49:44,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:44,604 INFO L225 Difference]: With dead ends: 42 [2022-02-20 16:49:44,604 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 16:49:44,607 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 16:49:44,612 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 29 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:49:44,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 157 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:49:44,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 16:49:44,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-02-20 16:49:44,638 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:49:44,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:49:44,640 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:49:44,641 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:49:44,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:44,645 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-02-20 16:49:44,645 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-02-20 16:49:44,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:44,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:44,646 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-02-20 16:49:44,647 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-02-20 16:49:44,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:44,651 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-02-20 16:49:44,651 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-02-20 16:49:44,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:44,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:44,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:49:44,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:49:44,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:49:44,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-02-20 16:49:44,656 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 14 [2022-02-20 16:49:44,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:49:44,657 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-02-20 16:49:44,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:49:44,657 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-02-20 16:49:44,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 16:49:44,658 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:49:44,658 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:49:44,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:49:44,659 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:49:44,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:49:44,660 INFO L85 PathProgramCache]: Analyzing trace with hash -181602474, now seen corresponding path program 1 times [2022-02-20 16:49:44,660 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:49:44,660 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754994025] [2022-02-20 16:49:44,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:49:44,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:49:44,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:44,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:49:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:44,727 INFO L290 TraceCheckUtils]: 0: Hoare triple {214#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;call #t~malloc4#1.base, #t~malloc4#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc4#1.base, #t~malloc4#1.offset, 1, ~size#1, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {202#true} is VALID [2022-02-20 16:49:44,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {202#true} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc4#1.base, #t~malloc4#1.offset; {202#true} is VALID [2022-02-20 16:49:44,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {202#true} assume true; {202#true} is VALID [2022-02-20 16:49:44,728 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {202#true} {202#true} #77#return; {202#true} is VALID [2022-02-20 16:49:44,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-20 16:49:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:44,775 INFO L290 TraceCheckUtils]: 0: Hoare triple {214#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;call #t~malloc4#1.base, #t~malloc4#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc4#1.base, #t~malloc4#1.offset, 1, ~size#1, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {215#(or (<= (+ |kzalloc_#t~malloc4#1.base| 1) 0) (not (<= |kzalloc_#t~malloc4#1.base| 0)))} is VALID [2022-02-20 16:49:44,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {215#(or (<= (+ |kzalloc_#t~malloc4#1.base| 1) 0) (not (<= |kzalloc_#t~malloc4#1.base| 0)))} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc4#1.base, #t~malloc4#1.offset; {216#(or (<= 1 |kzalloc_#res#1.base|) (<= (+ |kzalloc_#res#1.base| 1) 0))} is VALID [2022-02-20 16:49:44,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {216#(or (<= 1 |kzalloc_#res#1.base|) (<= (+ |kzalloc_#res#1.base| 1) 0))} assume true; {216#(or (<= 1 |kzalloc_#res#1.base|) (<= (+ |kzalloc_#res#1.base| 1) 0))} is VALID [2022-02-20 16:49:44,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {216#(or (<= 1 |kzalloc_#res#1.base|) (<= (+ |kzalloc_#res#1.base| 1) 0))} {202#true} #79#return; {212#(not (= |ULTIMATE.start_ebda_rsrc_controller_#t~ret9#1.base| 0))} is VALID [2022-02-20 16:49:44,778 INFO L290 TraceCheckUtils]: 0: Hoare triple {202#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~tmp_slot~0.base, ~tmp_slot~0.offset := 0, 0;~used_tmp_slot~0 := 0;~freed_tmp_slot~0 := 1; {202#true} is VALID [2022-02-20 16:49:44,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {202#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1;assume { :begin_inline_ebda_rsrc_controller } true;havoc ebda_rsrc_controller_#res#1;havoc ebda_rsrc_controller_#t~ret8#1.base, ebda_rsrc_controller_#t~ret8#1.offset, ebda_rsrc_controller_#t~ret9#1.base, ebda_rsrc_controller_#t~ret9#1.offset, ebda_rsrc_controller_#t~ret10#1.base, ebda_rsrc_controller_#t~ret10#1.offset, ebda_rsrc_controller_#t~ret11#1, ebda_rsrc_controller_#t~ret12#1, ebda_rsrc_controller_#t~mem13#1.base, ebda_rsrc_controller_#t~mem13#1.offset, ebda_rsrc_controller_~hp_slot_ptr~0#1.base, ebda_rsrc_controller_~hp_slot_ptr~0#1.offset, ebda_rsrc_controller_~bus_info_ptr1~0#1.base, ebda_rsrc_controller_~bus_info_ptr1~0#1.offset, ebda_rsrc_controller_~rc~0#1;havoc ebda_rsrc_controller_~hp_slot_ptr~0#1.base, ebda_rsrc_controller_~hp_slot_ptr~0#1.offset;havoc ebda_rsrc_controller_~bus_info_ptr1~0#1.base, ebda_rsrc_controller_~bus_info_ptr1~0#1.offset;havoc ebda_rsrc_controller_~rc~0#1; {202#true} is VALID [2022-02-20 16:49:44,780 INFO L272 TraceCheckUtils]: 2: Hoare triple {202#true} call ebda_rsrc_controller_#t~ret8#1.base, ebda_rsrc_controller_#t~ret8#1.offset := kzalloc(8, 1); {214#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:49:44,780 INFO L290 TraceCheckUtils]: 3: Hoare triple {214#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;call #t~malloc4#1.base, #t~malloc4#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc4#1.base, #t~malloc4#1.offset, 1, ~size#1, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {202#true} is VALID [2022-02-20 16:49:44,780 INFO L290 TraceCheckUtils]: 4: Hoare triple {202#true} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc4#1.base, #t~malloc4#1.offset; {202#true} is VALID [2022-02-20 16:49:44,780 INFO L290 TraceCheckUtils]: 5: Hoare triple {202#true} assume true; {202#true} is VALID [2022-02-20 16:49:44,781 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {202#true} {202#true} #77#return; {202#true} is VALID [2022-02-20 16:49:44,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {202#true} ebda_rsrc_controller_~hp_slot_ptr~0#1.base, ebda_rsrc_controller_~hp_slot_ptr~0#1.offset := ebda_rsrc_controller_#t~ret8#1.base, ebda_rsrc_controller_#t~ret8#1.offset;havoc ebda_rsrc_controller_#t~ret8#1.base, ebda_rsrc_controller_#t~ret8#1.offset; {202#true} is VALID [2022-02-20 16:49:44,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {202#true} assume !(ebda_rsrc_controller_~hp_slot_ptr~0#1.base == 0 && ebda_rsrc_controller_~hp_slot_ptr~0#1.offset == 0);call write~int(5, ebda_rsrc_controller_~hp_slot_ptr~0#1.base, 4 + ebda_rsrc_controller_~hp_slot_ptr~0#1.offset, 4); {202#true} is VALID [2022-02-20 16:49:44,782 INFO L272 TraceCheckUtils]: 9: Hoare triple {202#true} call ebda_rsrc_controller_#t~ret9#1.base, ebda_rsrc_controller_#t~ret9#1.offset := kzalloc(16, 1); {214#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:49:44,783 INFO L290 TraceCheckUtils]: 10: Hoare triple {214#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;call #t~malloc4#1.base, #t~malloc4#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc4#1.base, #t~malloc4#1.offset, 1, ~size#1, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {215#(or (<= (+ |kzalloc_#t~malloc4#1.base| 1) 0) (not (<= |kzalloc_#t~malloc4#1.base| 0)))} is VALID [2022-02-20 16:49:44,784 INFO L290 TraceCheckUtils]: 11: Hoare triple {215#(or (<= (+ |kzalloc_#t~malloc4#1.base| 1) 0) (not (<= |kzalloc_#t~malloc4#1.base| 0)))} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc4#1.base, #t~malloc4#1.offset; {216#(or (<= 1 |kzalloc_#res#1.base|) (<= (+ |kzalloc_#res#1.base| 1) 0))} is VALID [2022-02-20 16:49:44,785 INFO L290 TraceCheckUtils]: 12: Hoare triple {216#(or (<= 1 |kzalloc_#res#1.base|) (<= (+ |kzalloc_#res#1.base| 1) 0))} assume true; {216#(or (<= 1 |kzalloc_#res#1.base|) (<= (+ |kzalloc_#res#1.base| 1) 0))} is VALID [2022-02-20 16:49:44,786 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {216#(or (<= 1 |kzalloc_#res#1.base|) (<= (+ |kzalloc_#res#1.base| 1) 0))} {202#true} #79#return; {212#(not (= |ULTIMATE.start_ebda_rsrc_controller_#t~ret9#1.base| 0))} is VALID [2022-02-20 16:49:44,787 INFO L290 TraceCheckUtils]: 14: Hoare triple {212#(not (= |ULTIMATE.start_ebda_rsrc_controller_#t~ret9#1.base| 0))} ~tmp_slot~0.base, ~tmp_slot~0.offset := ebda_rsrc_controller_#t~ret9#1.base, ebda_rsrc_controller_#t~ret9#1.offset;havoc ebda_rsrc_controller_#t~ret9#1.base, ebda_rsrc_controller_#t~ret9#1.offset; {213#(not (= ~tmp_slot~0.base 0))} is VALID [2022-02-20 16:49:44,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {213#(not (= ~tmp_slot~0.base 0))} assume ~tmp_slot~0.base == 0 && ~tmp_slot~0.offset == 0;ebda_rsrc_controller_~rc~0#1 := -2; {203#false} is VALID [2022-02-20 16:49:44,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {203#false} ebda_rsrc_controller_#res#1 := ebda_rsrc_controller_~rc~0#1; {203#false} is VALID [2022-02-20 16:49:44,788 INFO L290 TraceCheckUtils]: 17: Hoare triple {203#false} main_#t~ret14#1 := ebda_rsrc_controller_#res#1;assume { :end_inline_ebda_rsrc_controller } true;assume -2147483648 <= main_#t~ret14#1 && main_#t~ret14#1 <= 2147483647;havoc main_#t~ret14#1; {203#false} is VALID [2022-02-20 16:49:44,788 INFO L290 TraceCheckUtils]: 18: Hoare triple {203#false} assume 0 == ~used_tmp_slot~0; {203#false} is VALID [2022-02-20 16:49:44,788 INFO L290 TraceCheckUtils]: 19: Hoare triple {203#false} assume !(0 != ~freed_tmp_slot~0);assume { :begin_inline___blast_assert } true; {203#false} is VALID [2022-02-20 16:49:44,789 INFO L290 TraceCheckUtils]: 20: Hoare triple {203#false} assume !false; {203#false} is VALID [2022-02-20 16:49:44,789 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 16:49:44,789 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:49:44,790 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754994025] [2022-02-20 16:49:44,790 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754994025] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:49:44,790 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:49:44,790 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 16:49:44,791 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474600321] [2022-02-20 16:49:44,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:49:44,792 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-02-20 16:49:44,792 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:49:44,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:49:44,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:44,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:49:44,812 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:49:44,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:49:44,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:49:44,813 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:49:45,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:45,102 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-02-20 16:49:45,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 16:49:45,102 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-02-20 16:49:45,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:49:45,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:49:45,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 43 transitions. [2022-02-20 16:49:45,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:49:45,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 43 transitions. [2022-02-20 16:49:45,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 43 transitions. [2022-02-20 16:49:45,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:45,165 INFO L225 Difference]: With dead ends: 39 [2022-02-20 16:49:45,165 INFO L226 Difference]: Without dead ends: 33 [2022-02-20 16:49:45,166 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-02-20 16:49:45,167 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 25 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:49:45,167 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 137 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:49:45,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-20 16:49:45,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-02-20 16:49:45,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:49:45,172 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:49:45,172 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:49:45,173 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:49:45,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:45,175 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-02-20 16:49:45,175 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-02-20 16:49:45,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:45,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:45,176 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 33 states. [2022-02-20 16:49:45,176 INFO L87 Difference]: Start difference. First operand has 33 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 33 states. [2022-02-20 16:49:45,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:45,179 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-02-20 16:49:45,179 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-02-20 16:49:45,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:45,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:45,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:49:45,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:49:45,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:49:45,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-02-20 16:49:45,182 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 21 [2022-02-20 16:49:45,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:49:45,182 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-02-20 16:49:45,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:49:45,183 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-02-20 16:49:45,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 16:49:45,183 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:49:45,184 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:49:45,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:49:45,184 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:49:45,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:49:45,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1758754954, now seen corresponding path program 1 times [2022-02-20 16:49:45,185 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:49:45,185 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204564622] [2022-02-20 16:49:45,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:49:45,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:49:45,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:45,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:49:45,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:45,273 INFO L290 TraceCheckUtils]: 0: Hoare triple {406#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;call #t~malloc4#1.base, #t~malloc4#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc4#1.base, #t~malloc4#1.offset, 1, ~size#1, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {389#true} is VALID [2022-02-20 16:49:45,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {389#true} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc4#1.base, #t~malloc4#1.offset; {389#true} is VALID [2022-02-20 16:49:45,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {389#true} assume true; {389#true} is VALID [2022-02-20 16:49:45,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {389#true} {389#true} #77#return; {389#true} is VALID [2022-02-20 16:49:45,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-20 16:49:45,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:45,281 INFO L290 TraceCheckUtils]: 0: Hoare triple {406#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;call #t~malloc4#1.base, #t~malloc4#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc4#1.base, #t~malloc4#1.offset, 1, ~size#1, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {389#true} is VALID [2022-02-20 16:49:45,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {389#true} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc4#1.base, #t~malloc4#1.offset; {389#true} is VALID [2022-02-20 16:49:45,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {389#true} assume true; {389#true} is VALID [2022-02-20 16:49:45,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {389#true} {389#true} #79#return; {389#true} is VALID [2022-02-20 16:49:45,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 16:49:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:45,337 INFO L290 TraceCheckUtils]: 0: Hoare triple {406#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;call #t~malloc4#1.base, #t~malloc4#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc4#1.base, #t~malloc4#1.offset, 1, ~size#1, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {407#(or (<= (+ |kzalloc_#t~malloc4#1.base| 1) 0) (not (<= |kzalloc_#t~malloc4#1.base| 0)))} is VALID [2022-02-20 16:49:45,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {407#(or (<= (+ |kzalloc_#t~malloc4#1.base| 1) 0) (not (<= |kzalloc_#t~malloc4#1.base| 0)))} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc4#1.base, #t~malloc4#1.offset; {408#(or (<= 1 |kzalloc_#res#1.base|) (<= (+ |kzalloc_#res#1.base| 1) 0))} is VALID [2022-02-20 16:49:45,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {408#(or (<= 1 |kzalloc_#res#1.base|) (<= (+ |kzalloc_#res#1.base| 1) 0))} assume true; {408#(or (<= 1 |kzalloc_#res#1.base|) (<= (+ |kzalloc_#res#1.base| 1) 0))} is VALID [2022-02-20 16:49:45,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {408#(or (<= 1 |kzalloc_#res#1.base|) (<= (+ |kzalloc_#res#1.base| 1) 0))} {389#true} #81#return; {403#(not (= |ULTIMATE.start_ibmphp_find_same_bus_num_#t~ret5#1.base| 0))} is VALID [2022-02-20 16:49:45,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {389#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~tmp_slot~0.base, ~tmp_slot~0.offset := 0, 0;~used_tmp_slot~0 := 0;~freed_tmp_slot~0 := 1; {389#true} is VALID [2022-02-20 16:49:45,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {389#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1;assume { :begin_inline_ebda_rsrc_controller } true;havoc ebda_rsrc_controller_#res#1;havoc ebda_rsrc_controller_#t~ret8#1.base, ebda_rsrc_controller_#t~ret8#1.offset, ebda_rsrc_controller_#t~ret9#1.base, ebda_rsrc_controller_#t~ret9#1.offset, ebda_rsrc_controller_#t~ret10#1.base, ebda_rsrc_controller_#t~ret10#1.offset, ebda_rsrc_controller_#t~ret11#1, ebda_rsrc_controller_#t~ret12#1, ebda_rsrc_controller_#t~mem13#1.base, ebda_rsrc_controller_#t~mem13#1.offset, ebda_rsrc_controller_~hp_slot_ptr~0#1.base, ebda_rsrc_controller_~hp_slot_ptr~0#1.offset, ebda_rsrc_controller_~bus_info_ptr1~0#1.base, ebda_rsrc_controller_~bus_info_ptr1~0#1.offset, ebda_rsrc_controller_~rc~0#1;havoc ebda_rsrc_controller_~hp_slot_ptr~0#1.base, ebda_rsrc_controller_~hp_slot_ptr~0#1.offset;havoc ebda_rsrc_controller_~bus_info_ptr1~0#1.base, ebda_rsrc_controller_~bus_info_ptr1~0#1.offset;havoc ebda_rsrc_controller_~rc~0#1; {389#true} is VALID [2022-02-20 16:49:45,343 INFO L272 TraceCheckUtils]: 2: Hoare triple {389#true} call ebda_rsrc_controller_#t~ret8#1.base, ebda_rsrc_controller_#t~ret8#1.offset := kzalloc(8, 1); {406#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:49:45,343 INFO L290 TraceCheckUtils]: 3: Hoare triple {406#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;call #t~malloc4#1.base, #t~malloc4#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc4#1.base, #t~malloc4#1.offset, 1, ~size#1, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {389#true} is VALID [2022-02-20 16:49:45,344 INFO L290 TraceCheckUtils]: 4: Hoare triple {389#true} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc4#1.base, #t~malloc4#1.offset; {389#true} is VALID [2022-02-20 16:49:45,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {389#true} assume true; {389#true} is VALID [2022-02-20 16:49:45,344 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {389#true} {389#true} #77#return; {389#true} is VALID [2022-02-20 16:49:45,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {389#true} ebda_rsrc_controller_~hp_slot_ptr~0#1.base, ebda_rsrc_controller_~hp_slot_ptr~0#1.offset := ebda_rsrc_controller_#t~ret8#1.base, ebda_rsrc_controller_#t~ret8#1.offset;havoc ebda_rsrc_controller_#t~ret8#1.base, ebda_rsrc_controller_#t~ret8#1.offset; {389#true} is VALID [2022-02-20 16:49:45,345 INFO L290 TraceCheckUtils]: 8: Hoare triple {389#true} assume !(ebda_rsrc_controller_~hp_slot_ptr~0#1.base == 0 && ebda_rsrc_controller_~hp_slot_ptr~0#1.offset == 0);call write~int(5, ebda_rsrc_controller_~hp_slot_ptr~0#1.base, 4 + ebda_rsrc_controller_~hp_slot_ptr~0#1.offset, 4); {389#true} is VALID [2022-02-20 16:49:45,346 INFO L272 TraceCheckUtils]: 9: Hoare triple {389#true} call ebda_rsrc_controller_#t~ret9#1.base, ebda_rsrc_controller_#t~ret9#1.offset := kzalloc(16, 1); {406#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:49:45,346 INFO L290 TraceCheckUtils]: 10: Hoare triple {406#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;call #t~malloc4#1.base, #t~malloc4#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc4#1.base, #t~malloc4#1.offset, 1, ~size#1, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {389#true} is VALID [2022-02-20 16:49:45,347 INFO L290 TraceCheckUtils]: 11: Hoare triple {389#true} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc4#1.base, #t~malloc4#1.offset; {389#true} is VALID [2022-02-20 16:49:45,347 INFO L290 TraceCheckUtils]: 12: Hoare triple {389#true} assume true; {389#true} is VALID [2022-02-20 16:49:45,347 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {389#true} {389#true} #79#return; {389#true} is VALID [2022-02-20 16:49:45,350 INFO L290 TraceCheckUtils]: 14: Hoare triple {389#true} ~tmp_slot~0.base, ~tmp_slot~0.offset := ebda_rsrc_controller_#t~ret9#1.base, ebda_rsrc_controller_#t~ret9#1.offset;havoc ebda_rsrc_controller_#t~ret9#1.base, ebda_rsrc_controller_#t~ret9#1.offset; {389#true} is VALID [2022-02-20 16:49:45,350 INFO L290 TraceCheckUtils]: 15: Hoare triple {389#true} assume !(~tmp_slot~0.base == 0 && ~tmp_slot~0.offset == 0);~used_tmp_slot~0 := 0;~freed_tmp_slot~0 := 0;call write~int(2, ~tmp_slot~0.base, ~tmp_slot~0.offset, 4);call write~int(3, ~tmp_slot~0.base, 4 + ~tmp_slot~0.offset, 4);assume { :begin_inline_ibmphp_find_same_bus_num } true;havoc ibmphp_find_same_bus_num_#res#1.base, ibmphp_find_same_bus_num_#res#1.offset;havoc ibmphp_find_same_bus_num_#t~ret5#1.base, ibmphp_find_same_bus_num_#t~ret5#1.offset; {389#true} is VALID [2022-02-20 16:49:45,351 INFO L272 TraceCheckUtils]: 16: Hoare triple {389#true} call ibmphp_find_same_bus_num_#t~ret5#1.base, ibmphp_find_same_bus_num_#t~ret5#1.offset := kzalloc(0, 0); {406#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:49:45,353 INFO L290 TraceCheckUtils]: 17: Hoare triple {406#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;call #t~malloc4#1.base, #t~malloc4#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc4#1.base, #t~malloc4#1.offset, 1, ~size#1, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {407#(or (<= (+ |kzalloc_#t~malloc4#1.base| 1) 0) (not (<= |kzalloc_#t~malloc4#1.base| 0)))} is VALID [2022-02-20 16:49:45,354 INFO L290 TraceCheckUtils]: 18: Hoare triple {407#(or (<= (+ |kzalloc_#t~malloc4#1.base| 1) 0) (not (<= |kzalloc_#t~malloc4#1.base| 0)))} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc4#1.base, #t~malloc4#1.offset; {408#(or (<= 1 |kzalloc_#res#1.base|) (<= (+ |kzalloc_#res#1.base| 1) 0))} is VALID [2022-02-20 16:49:45,354 INFO L290 TraceCheckUtils]: 19: Hoare triple {408#(or (<= 1 |kzalloc_#res#1.base|) (<= (+ |kzalloc_#res#1.base| 1) 0))} assume true; {408#(or (<= 1 |kzalloc_#res#1.base|) (<= (+ |kzalloc_#res#1.base| 1) 0))} is VALID [2022-02-20 16:49:45,355 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {408#(or (<= 1 |kzalloc_#res#1.base|) (<= (+ |kzalloc_#res#1.base| 1) 0))} {389#true} #81#return; {403#(not (= |ULTIMATE.start_ibmphp_find_same_bus_num_#t~ret5#1.base| 0))} is VALID [2022-02-20 16:49:45,356 INFO L290 TraceCheckUtils]: 21: Hoare triple {403#(not (= |ULTIMATE.start_ibmphp_find_same_bus_num_#t~ret5#1.base| 0))} ibmphp_find_same_bus_num_#res#1.base, ibmphp_find_same_bus_num_#res#1.offset := ibmphp_find_same_bus_num_#t~ret5#1.base, ibmphp_find_same_bus_num_#t~ret5#1.offset;havoc ibmphp_find_same_bus_num_#t~ret5#1.base, ibmphp_find_same_bus_num_#t~ret5#1.offset; {404#(not (= |ULTIMATE.start_ibmphp_find_same_bus_num_#res#1.base| 0))} is VALID [2022-02-20 16:49:45,356 INFO L290 TraceCheckUtils]: 22: Hoare triple {404#(not (= |ULTIMATE.start_ibmphp_find_same_bus_num_#res#1.base| 0))} ebda_rsrc_controller_#t~ret10#1.base, ebda_rsrc_controller_#t~ret10#1.offset := ibmphp_find_same_bus_num_#res#1.base, ibmphp_find_same_bus_num_#res#1.offset;assume { :end_inline_ibmphp_find_same_bus_num } true;ebda_rsrc_controller_~bus_info_ptr1~0#1.base, ebda_rsrc_controller_~bus_info_ptr1~0#1.offset := ebda_rsrc_controller_#t~ret10#1.base, ebda_rsrc_controller_#t~ret10#1.offset;havoc ebda_rsrc_controller_#t~ret10#1.base, ebda_rsrc_controller_#t~ret10#1.offset; {405#(not (= |ULTIMATE.start_ebda_rsrc_controller_~bus_info_ptr1~0#1.base| 0))} is VALID [2022-02-20 16:49:45,357 INFO L290 TraceCheckUtils]: 23: Hoare triple {405#(not (= |ULTIMATE.start_ebda_rsrc_controller_~bus_info_ptr1~0#1.base| 0))} assume ebda_rsrc_controller_~bus_info_ptr1~0#1.base == 0 && ebda_rsrc_controller_~bus_info_ptr1~0#1.offset == 0;ebda_rsrc_controller_~rc~0#1 := -3; {390#false} is VALID [2022-02-20 16:49:45,357 INFO L290 TraceCheckUtils]: 24: Hoare triple {390#false} call ebda_rsrc_controller_#t~mem13#1.base, ebda_rsrc_controller_#t~mem13#1.offset := read~$Pointer$(ebda_rsrc_controller_~hp_slot_ptr~0#1.base, ebda_rsrc_controller_~hp_slot_ptr~0#1.offset, 4);assume { :begin_inline_kfree } true;kfree_#in~p#1.base, kfree_#in~p#1.offset := ebda_rsrc_controller_#t~mem13#1.base, ebda_rsrc_controller_#t~mem13#1.offset;havoc kfree_~p#1.base, kfree_~p#1.offset;kfree_~p#1.base, kfree_~p#1.offset := kfree_#in~p#1.base, kfree_#in~p#1.offset; {390#false} is VALID [2022-02-20 16:49:45,357 INFO L290 TraceCheckUtils]: 25: Hoare triple {390#false} assume (kfree_~p#1.base != 0 || kfree_~p#1.offset != 0) && kfree_~p#1.base == ~tmp_slot~0.base && kfree_~p#1.offset == ~tmp_slot~0.offset;~freed_tmp_slot~0 := 1; {390#false} is VALID [2022-02-20 16:49:45,358 INFO L290 TraceCheckUtils]: 26: Hoare triple {390#false} assume { :end_inline_kfree } true;havoc ebda_rsrc_controller_#t~mem13#1.base, ebda_rsrc_controller_#t~mem13#1.offset; {390#false} is VALID [2022-02-20 16:49:45,358 INFO L290 TraceCheckUtils]: 27: Hoare triple {390#false} ebda_rsrc_controller_#res#1 := ebda_rsrc_controller_~rc~0#1; {390#false} is VALID [2022-02-20 16:49:45,358 INFO L290 TraceCheckUtils]: 28: Hoare triple {390#false} main_#t~ret14#1 := ebda_rsrc_controller_#res#1;assume { :end_inline_ebda_rsrc_controller } true;assume -2147483648 <= main_#t~ret14#1 && main_#t~ret14#1 <= 2147483647;havoc main_#t~ret14#1; {390#false} is VALID [2022-02-20 16:49:45,358 INFO L290 TraceCheckUtils]: 29: Hoare triple {390#false} assume 0 == ~used_tmp_slot~0; {390#false} is VALID [2022-02-20 16:49:45,358 INFO L290 TraceCheckUtils]: 30: Hoare triple {390#false} assume !(0 != ~freed_tmp_slot~0);assume { :begin_inline___blast_assert } true; {390#false} is VALID [2022-02-20 16:49:45,359 INFO L290 TraceCheckUtils]: 31: Hoare triple {390#false} assume !false; {390#false} is VALID [2022-02-20 16:49:45,359 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 16:49:45,360 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:49:45,361 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204564622] [2022-02-20 16:49:45,361 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204564622] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:49:45,361 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:49:45,361 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 16:49:45,361 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389545148] [2022-02-20 16:49:45,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:49:45,363 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-02-20 16:49:45,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:49:45,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 16:49:45,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:45,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 16:49:45,393 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:49:45,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 16:49:45,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 16:49:45,394 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 16:49:45,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:45,633 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-02-20 16:49:45,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 16:49:45,633 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-02-20 16:49:45,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:49:45,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 16:49:45,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-02-20 16:49:45,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 16:49:45,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-02-20 16:49:45,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-02-20 16:49:45,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:45,678 INFO L225 Difference]: With dead ends: 42 [2022-02-20 16:49:45,679 INFO L226 Difference]: Without dead ends: 33 [2022-02-20 16:49:45,679 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-02-20 16:49:45,680 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 18 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:49:45,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 169 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:49:45,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-20 16:49:45,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-02-20 16:49:45,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:49:45,684 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:49:45,685 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:49:45,685 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:49:45,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:45,687 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-02-20 16:49:45,687 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-02-20 16:49:45,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:45,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:45,688 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 33 states. [2022-02-20 16:49:45,688 INFO L87 Difference]: Start difference. First operand has 33 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 33 states. [2022-02-20 16:49:45,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:45,690 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-02-20 16:49:45,690 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-02-20 16:49:45,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:45,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:45,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:49:45,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:49:45,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:49:45,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-02-20 16:49:45,697 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 32 [2022-02-20 16:49:45,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:49:45,697 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-02-20 16:49:45,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 16:49:45,698 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-02-20 16:49:45,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 16:49:45,699 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:49:45,699 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:49:45,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:49:45,700 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:49:45,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:49:45,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1338195985, now seen corresponding path program 1 times [2022-02-20 16:49:45,702 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:49:45,704 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516462732] [2022-02-20 16:49:45,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:49:45,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:49:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:45,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:49:45,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:45,789 INFO L290 TraceCheckUtils]: 0: Hoare triple {596#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;call #t~malloc4#1.base, #t~malloc4#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc4#1.base, #t~malloc4#1.offset, 1, ~size#1, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {581#true} is VALID [2022-02-20 16:49:45,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {581#true} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc4#1.base, #t~malloc4#1.offset; {581#true} is VALID [2022-02-20 16:49:45,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {581#true} assume true; {581#true} is VALID [2022-02-20 16:49:45,790 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {581#true} {581#true} #77#return; {581#true} is VALID [2022-02-20 16:49:45,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-20 16:49:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:45,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {596#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;call #t~malloc4#1.base, #t~malloc4#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc4#1.base, #t~malloc4#1.offset, 1, ~size#1, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {581#true} is VALID [2022-02-20 16:49:45,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {581#true} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc4#1.base, #t~malloc4#1.offset; {581#true} is VALID [2022-02-20 16:49:45,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {581#true} assume true; {581#true} is VALID [2022-02-20 16:49:45,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {581#true} {581#true} #79#return; {581#true} is VALID [2022-02-20 16:49:45,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 16:49:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:45,804 INFO L290 TraceCheckUtils]: 0: Hoare triple {596#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;call #t~malloc4#1.base, #t~malloc4#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc4#1.base, #t~malloc4#1.offset, 1, ~size#1, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {581#true} is VALID [2022-02-20 16:49:45,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {581#true} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc4#1.base, #t~malloc4#1.offset; {581#true} is VALID [2022-02-20 16:49:45,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {581#true} assume true; {581#true} is VALID [2022-02-20 16:49:45,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {581#true} {581#true} #81#return; {581#true} is VALID [2022-02-20 16:49:45,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {581#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~tmp_slot~0.base, ~tmp_slot~0.offset := 0, 0;~used_tmp_slot~0 := 0;~freed_tmp_slot~0 := 1; {581#true} is VALID [2022-02-20 16:49:45,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {581#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1;assume { :begin_inline_ebda_rsrc_controller } true;havoc ebda_rsrc_controller_#res#1;havoc ebda_rsrc_controller_#t~ret8#1.base, ebda_rsrc_controller_#t~ret8#1.offset, ebda_rsrc_controller_#t~ret9#1.base, ebda_rsrc_controller_#t~ret9#1.offset, ebda_rsrc_controller_#t~ret10#1.base, ebda_rsrc_controller_#t~ret10#1.offset, ebda_rsrc_controller_#t~ret11#1, ebda_rsrc_controller_#t~ret12#1, ebda_rsrc_controller_#t~mem13#1.base, ebda_rsrc_controller_#t~mem13#1.offset, ebda_rsrc_controller_~hp_slot_ptr~0#1.base, ebda_rsrc_controller_~hp_slot_ptr~0#1.offset, ebda_rsrc_controller_~bus_info_ptr1~0#1.base, ebda_rsrc_controller_~bus_info_ptr1~0#1.offset, ebda_rsrc_controller_~rc~0#1;havoc ebda_rsrc_controller_~hp_slot_ptr~0#1.base, ebda_rsrc_controller_~hp_slot_ptr~0#1.offset;havoc ebda_rsrc_controller_~bus_info_ptr1~0#1.base, ebda_rsrc_controller_~bus_info_ptr1~0#1.offset;havoc ebda_rsrc_controller_~rc~0#1; {581#true} is VALID [2022-02-20 16:49:45,807 INFO L272 TraceCheckUtils]: 2: Hoare triple {581#true} call ebda_rsrc_controller_#t~ret8#1.base, ebda_rsrc_controller_#t~ret8#1.offset := kzalloc(8, 1); {596#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:49:45,807 INFO L290 TraceCheckUtils]: 3: Hoare triple {596#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;call #t~malloc4#1.base, #t~malloc4#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc4#1.base, #t~malloc4#1.offset, 1, ~size#1, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {581#true} is VALID [2022-02-20 16:49:45,807 INFO L290 TraceCheckUtils]: 4: Hoare triple {581#true} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc4#1.base, #t~malloc4#1.offset; {581#true} is VALID [2022-02-20 16:49:45,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {581#true} assume true; {581#true} is VALID [2022-02-20 16:49:45,808 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {581#true} {581#true} #77#return; {581#true} is VALID [2022-02-20 16:49:45,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {581#true} ebda_rsrc_controller_~hp_slot_ptr~0#1.base, ebda_rsrc_controller_~hp_slot_ptr~0#1.offset := ebda_rsrc_controller_#t~ret8#1.base, ebda_rsrc_controller_#t~ret8#1.offset;havoc ebda_rsrc_controller_#t~ret8#1.base, ebda_rsrc_controller_#t~ret8#1.offset; {581#true} is VALID [2022-02-20 16:49:45,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {581#true} assume !(ebda_rsrc_controller_~hp_slot_ptr~0#1.base == 0 && ebda_rsrc_controller_~hp_slot_ptr~0#1.offset == 0);call write~int(5, ebda_rsrc_controller_~hp_slot_ptr~0#1.base, 4 + ebda_rsrc_controller_~hp_slot_ptr~0#1.offset, 4); {581#true} is VALID [2022-02-20 16:49:45,809 INFO L272 TraceCheckUtils]: 9: Hoare triple {581#true} call ebda_rsrc_controller_#t~ret9#1.base, ebda_rsrc_controller_#t~ret9#1.offset := kzalloc(16, 1); {596#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:49:45,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {596#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;call #t~malloc4#1.base, #t~malloc4#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc4#1.base, #t~malloc4#1.offset, 1, ~size#1, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {581#true} is VALID [2022-02-20 16:49:45,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {581#true} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc4#1.base, #t~malloc4#1.offset; {581#true} is VALID [2022-02-20 16:49:45,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {581#true} assume true; {581#true} is VALID [2022-02-20 16:49:45,810 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {581#true} {581#true} #79#return; {581#true} is VALID [2022-02-20 16:49:45,810 INFO L290 TraceCheckUtils]: 14: Hoare triple {581#true} ~tmp_slot~0.base, ~tmp_slot~0.offset := ebda_rsrc_controller_#t~ret9#1.base, ebda_rsrc_controller_#t~ret9#1.offset;havoc ebda_rsrc_controller_#t~ret9#1.base, ebda_rsrc_controller_#t~ret9#1.offset; {581#true} is VALID [2022-02-20 16:49:45,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {581#true} assume !(~tmp_slot~0.base == 0 && ~tmp_slot~0.offset == 0);~used_tmp_slot~0 := 0;~freed_tmp_slot~0 := 0;call write~int(2, ~tmp_slot~0.base, ~tmp_slot~0.offset, 4);call write~int(3, ~tmp_slot~0.base, 4 + ~tmp_slot~0.offset, 4);assume { :begin_inline_ibmphp_find_same_bus_num } true;havoc ibmphp_find_same_bus_num_#res#1.base, ibmphp_find_same_bus_num_#res#1.offset;havoc ibmphp_find_same_bus_num_#t~ret5#1.base, ibmphp_find_same_bus_num_#t~ret5#1.offset; {581#true} is VALID [2022-02-20 16:49:45,811 INFO L272 TraceCheckUtils]: 16: Hoare triple {581#true} call ibmphp_find_same_bus_num_#t~ret5#1.base, ibmphp_find_same_bus_num_#t~ret5#1.offset := kzalloc(0, 0); {596#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:49:45,811 INFO L290 TraceCheckUtils]: 17: Hoare triple {596#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;call #t~malloc4#1.base, #t~malloc4#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc4#1.base, #t~malloc4#1.offset, 1, ~size#1, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {581#true} is VALID [2022-02-20 16:49:45,811 INFO L290 TraceCheckUtils]: 18: Hoare triple {581#true} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc4#1.base, #t~malloc4#1.offset; {581#true} is VALID [2022-02-20 16:49:45,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {581#true} assume true; {581#true} is VALID [2022-02-20 16:49:45,812 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {581#true} {581#true} #81#return; {581#true} is VALID [2022-02-20 16:49:45,812 INFO L290 TraceCheckUtils]: 21: Hoare triple {581#true} ibmphp_find_same_bus_num_#res#1.base, ibmphp_find_same_bus_num_#res#1.offset := ibmphp_find_same_bus_num_#t~ret5#1.base, ibmphp_find_same_bus_num_#t~ret5#1.offset;havoc ibmphp_find_same_bus_num_#t~ret5#1.base, ibmphp_find_same_bus_num_#t~ret5#1.offset; {581#true} is VALID [2022-02-20 16:49:45,812 INFO L290 TraceCheckUtils]: 22: Hoare triple {581#true} ebda_rsrc_controller_#t~ret10#1.base, ebda_rsrc_controller_#t~ret10#1.offset := ibmphp_find_same_bus_num_#res#1.base, ibmphp_find_same_bus_num_#res#1.offset;assume { :end_inline_ibmphp_find_same_bus_num } true;ebda_rsrc_controller_~bus_info_ptr1~0#1.base, ebda_rsrc_controller_~bus_info_ptr1~0#1.offset := ebda_rsrc_controller_#t~ret10#1.base, ebda_rsrc_controller_#t~ret10#1.offset;havoc ebda_rsrc_controller_#t~ret10#1.base, ebda_rsrc_controller_#t~ret10#1.offset; {581#true} is VALID [2022-02-20 16:49:45,813 INFO L290 TraceCheckUtils]: 23: Hoare triple {581#true} assume !(ebda_rsrc_controller_~bus_info_ptr1~0#1.base == 0 && ebda_rsrc_controller_~bus_info_ptr1~0#1.offset == 0);call write~$Pointer$(ebda_rsrc_controller_~bus_info_ptr1~0#1.base, ebda_rsrc_controller_~bus_info_ptr1~0#1.offset, ~tmp_slot~0.base, 12 + ~tmp_slot~0.offset, 4);ebda_rsrc_controller_~bus_info_ptr1~0#1.base, ebda_rsrc_controller_~bus_info_ptr1~0#1.offset := 0, 0;call write~$Pointer$(ebda_rsrc_controller_~hp_slot_ptr~0#1.base, ebda_rsrc_controller_~hp_slot_ptr~0#1.offset, ~tmp_slot~0.base, 8 + ~tmp_slot~0.offset, 4);call write~$Pointer$(~tmp_slot~0.base, ~tmp_slot~0.offset, ebda_rsrc_controller_~hp_slot_ptr~0#1.base, ebda_rsrc_controller_~hp_slot_ptr~0#1.offset, 4);~used_tmp_slot~0 := 1;assume { :begin_inline_fillslotinfo } true;fillslotinfo_#in~p#1.base, fillslotinfo_#in~p#1.offset := ebda_rsrc_controller_~hp_slot_ptr~0#1.base, ebda_rsrc_controller_~hp_slot_ptr~0#1.offset;havoc fillslotinfo_#res#1;havoc fillslotinfo_#t~nondet6#1, fillslotinfo_~p#1.base, fillslotinfo_~p#1.offset;fillslotinfo_~p#1.base, fillslotinfo_~p#1.offset := fillslotinfo_#in~p#1.base, fillslotinfo_#in~p#1.offset;assume -2147483648 <= fillslotinfo_#t~nondet6#1 && fillslotinfo_#t~nondet6#1 <= 2147483647;fillslotinfo_#res#1 := fillslotinfo_#t~nondet6#1;havoc fillslotinfo_#t~nondet6#1; {595#(= ~used_tmp_slot~0 1)} is VALID [2022-02-20 16:49:45,813 INFO L290 TraceCheckUtils]: 24: Hoare triple {595#(= ~used_tmp_slot~0 1)} ebda_rsrc_controller_#t~ret11#1 := fillslotinfo_#res#1;assume { :end_inline_fillslotinfo } true;assume -2147483648 <= ebda_rsrc_controller_#t~ret11#1 && ebda_rsrc_controller_#t~ret11#1 <= 2147483647;ebda_rsrc_controller_~rc~0#1 := ebda_rsrc_controller_#t~ret11#1;havoc ebda_rsrc_controller_#t~ret11#1; {595#(= ~used_tmp_slot~0 1)} is VALID [2022-02-20 16:49:45,814 INFO L290 TraceCheckUtils]: 25: Hoare triple {595#(= ~used_tmp_slot~0 1)} assume !(0 != ebda_rsrc_controller_~rc~0#1);assume { :begin_inline_ibmphp_init_devno } true;ibmphp_init_devno_#in~pp#1.base, ibmphp_init_devno_#in~pp#1.offset := ebda_rsrc_controller_~hp_slot_ptr~0#1.base, ebda_rsrc_controller_~hp_slot_ptr~0#1.offset;havoc ibmphp_init_devno_#res#1;havoc ibmphp_init_devno_#t~nondet7#1, ibmphp_init_devno_~pp#1.base, ibmphp_init_devno_~pp#1.offset;ibmphp_init_devno_~pp#1.base, ibmphp_init_devno_~pp#1.offset := ibmphp_init_devno_#in~pp#1.base, ibmphp_init_devno_#in~pp#1.offset;assume -2147483648 <= ibmphp_init_devno_#t~nondet7#1 && ibmphp_init_devno_#t~nondet7#1 <= 2147483647;ibmphp_init_devno_#res#1 := ibmphp_init_devno_#t~nondet7#1;havoc ibmphp_init_devno_#t~nondet7#1; {595#(= ~used_tmp_slot~0 1)} is VALID [2022-02-20 16:49:45,814 INFO L290 TraceCheckUtils]: 26: Hoare triple {595#(= ~used_tmp_slot~0 1)} ebda_rsrc_controller_#t~ret12#1 := ibmphp_init_devno_#res#1;assume { :end_inline_ibmphp_init_devno } true;assume -2147483648 <= ebda_rsrc_controller_#t~ret12#1 && ebda_rsrc_controller_#t~ret12#1 <= 2147483647;ebda_rsrc_controller_~rc~0#1 := ebda_rsrc_controller_#t~ret12#1;havoc ebda_rsrc_controller_#t~ret12#1; {595#(= ~used_tmp_slot~0 1)} is VALID [2022-02-20 16:49:45,815 INFO L290 TraceCheckUtils]: 27: Hoare triple {595#(= ~used_tmp_slot~0 1)} assume !(0 != ebda_rsrc_controller_~rc~0#1);ebda_rsrc_controller_#res#1 := 0; {595#(= ~used_tmp_slot~0 1)} is VALID [2022-02-20 16:49:45,815 INFO L290 TraceCheckUtils]: 28: Hoare triple {595#(= ~used_tmp_slot~0 1)} main_#t~ret14#1 := ebda_rsrc_controller_#res#1;assume { :end_inline_ebda_rsrc_controller } true;assume -2147483648 <= main_#t~ret14#1 && main_#t~ret14#1 <= 2147483647;havoc main_#t~ret14#1; {595#(= ~used_tmp_slot~0 1)} is VALID [2022-02-20 16:49:45,816 INFO L290 TraceCheckUtils]: 29: Hoare triple {595#(= ~used_tmp_slot~0 1)} assume 0 == ~used_tmp_slot~0; {582#false} is VALID [2022-02-20 16:49:45,816 INFO L290 TraceCheckUtils]: 30: Hoare triple {582#false} assume !(0 != ~freed_tmp_slot~0);assume { :begin_inline___blast_assert } true; {582#false} is VALID [2022-02-20 16:49:45,816 INFO L290 TraceCheckUtils]: 31: Hoare triple {582#false} assume !false; {582#false} is VALID [2022-02-20 16:49:45,816 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 16:49:45,817 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:49:45,817 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516462732] [2022-02-20 16:49:45,817 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516462732] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:49:45,817 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:49:45,817 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:49:45,818 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021732717] [2022-02-20 16:49:45,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:49:45,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-02-20 16:49:45,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:49:45,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 16:49:45,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:45,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:49:45,841 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:49:45,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:49:45,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:49:45,842 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 16:49:45,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:45,907 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-02-20 16:49:45,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:49:45,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-02-20 16:49:45,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:49:45,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 16:49:45,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-02-20 16:49:45,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 16:49:45,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-02-20 16:49:45,911 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 33 transitions. [2022-02-20 16:49:45,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:45,945 INFO L225 Difference]: With dead ends: 33 [2022-02-20 16:49:45,945 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:49:45,946 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:49:45,947 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 7 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:49:45,947 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 65 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:49:45,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:49:45,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:49:45,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:49:45,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:49:45,949 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:49:45,949 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:49:45,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:45,949 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:49:45,949 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:49:45,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:45,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:45,950 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 16:49:45,950 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 16:49:45,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:45,950 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:49:45,950 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:49:45,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:45,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:45,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:49:45,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:49:45,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:49:45,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:49:45,952 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2022-02-20 16:49:45,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:49:45,952 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:49:45,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 16:49:45,952 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:49:45,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:45,955 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:49:45,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 16:49:45,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:49:46,026 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:49:46,027 INFO L858 garLoopResultBuilder]: For program point kzallocEXIT(line 48) no Hoare annotation was computed. [2022-02-20 16:49:46,027 INFO L854 garLoopResultBuilder]: At program point kzallocENTRY(line 48) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2022-02-20 16:49:46,027 INFO L858 garLoopResultBuilder]: For program point kzallocFINAL(line 48) no Hoare annotation was computed. [2022-02-20 16:49:46,027 INFO L854 garLoopResultBuilder]: At program point L64(lines 62 65) the Hoare annotation is: (and (not (= ~tmp_slot~0.base 0)) (not (= |ULTIMATE.start_ebda_rsrc_controller_~hp_slot_ptr~0#1.base| 0)) (not (= |ULTIMATE.start_ibmphp_find_same_bus_num_#res#1.base| 0)) (= ~used_tmp_slot~0 1)) [2022-02-20 16:49:46,027 INFO L854 garLoopResultBuilder]: At program point L122(lines 72 133) the Hoare annotation is: (and (not (= ~tmp_slot~0.base 0)) (not (= |ULTIMATE.start_ebda_rsrc_controller_~hp_slot_ptr~0#1.base| 0)) (not (= |ULTIMATE.start_ibmphp_find_same_bus_num_#res#1.base| 0)) (= ~used_tmp_slot~0 1)) [2022-02-20 16:49:46,027 INFO L854 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: (not (= |ULTIMATE.start_ebda_rsrc_controller_~hp_slot_ptr~0#1.base| 0)) [2022-02-20 16:49:46,027 INFO L858 garLoopResultBuilder]: For program point L85-1(line 85) no Hoare annotation was computed. [2022-02-20 16:49:46,028 INFO L858 garLoopResultBuilder]: For program point L135(lines 135 139) no Hoare annotation was computed. [2022-02-20 16:49:46,028 INFO L854 garLoopResultBuilder]: At program point L69(lines 67 70) the Hoare annotation is: (and (not (= ~tmp_slot~0.base 0)) (not (= |ULTIMATE.start_ebda_rsrc_controller_~hp_slot_ptr~0#1.base| 0)) (not (= |ULTIMATE.start_ibmphp_find_same_bus_num_#res#1.base| 0)) (= ~used_tmp_slot~0 1)) [2022-02-20 16:49:46,028 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:49:46,028 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:49:46,028 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:49:46,028 INFO L854 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (and (not (= ~tmp_slot~0.base 0)) (not (= |ULTIMATE.start_ebda_rsrc_controller_~hp_slot_ptr~0#1.base| 0))) [2022-02-20 16:49:46,028 INFO L858 garLoopResultBuilder]: For program point L57-1(line 57) no Hoare annotation was computed. [2022-02-20 16:49:46,028 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2022-02-20 16:49:46,029 INFO L854 garLoopResultBuilder]: At program point L57-2(lines 56 58) the Hoare annotation is: (and (not (= ~tmp_slot~0.base 0)) (not (= |ULTIMATE.start_ebda_rsrc_controller_~hp_slot_ptr~0#1.base| 0)) (not (= |ULTIMATE.start_ibmphp_find_same_bus_num_#res#1.base| 0))) [2022-02-20 16:49:46,029 INFO L861 garLoopResultBuilder]: At program point L78(line 78) the Hoare annotation is: true [2022-02-20 16:49:46,029 INFO L858 garLoopResultBuilder]: For program point L78-1(line 78) no Hoare annotation was computed. [2022-02-20 16:49:46,029 INFO L858 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2022-02-20 16:49:46,029 INFO L854 garLoopResultBuilder]: At program point L132(lines 72 133) the Hoare annotation is: (and (not (= ~tmp_slot~0.base 0)) (not (= |ULTIMATE.start_ebda_rsrc_controller_~hp_slot_ptr~0#1.base| 0)) (not (= |ULTIMATE.start_ibmphp_find_same_bus_num_#res#1.base| 0)) (= ~used_tmp_slot~0 1)) [2022-02-20 16:49:46,029 INFO L858 garLoopResultBuilder]: For program point L99(lines 99 107) no Hoare annotation was computed. [2022-02-20 16:49:46,029 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:49:46,029 INFO L854 garLoopResultBuilder]: At program point L128(lines 72 133) the Hoare annotation is: (and (not (= ~tmp_slot~0.base 0)) (not (= |ULTIMATE.start_ebda_rsrc_controller_~hp_slot_ptr~0#1.base| 0)) (not (= |ULTIMATE.start_ibmphp_find_same_bus_num_#res#1.base| 0)) (= ~used_tmp_slot~0 1)) [2022-02-20 16:49:46,029 INFO L858 garLoopResultBuilder]: For program point L87(lines 87 90) no Hoare annotation was computed. [2022-02-20 16:49:46,030 INFO L858 garLoopResultBuilder]: For program point L50(lines 50 53) no Hoare annotation was computed. [2022-02-20 16:49:46,030 INFO L858 garLoopResultBuilder]: For program point L79(lines 79 82) no Hoare annotation was computed. [2022-02-20 16:49:46,030 INFO L858 garLoopResultBuilder]: For program point L137(lines 137 138) no Hoare annotation was computed. [2022-02-20 16:49:46,030 INFO L858 garLoopResultBuilder]: For program point L121(lines 121 122) no Hoare annotation was computed. [2022-02-20 16:49:46,030 INFO L858 garLoopResultBuilder]: For program point L117(lines 117 118) no Hoare annotation was computed. [2022-02-20 16:49:46,030 INFO L858 garLoopResultBuilder]: For program point L51(lines 51 52) no Hoare annotation was computed. [2022-02-20 16:49:46,030 INFO L858 garLoopResultBuilder]: For program point L138(line 138) no Hoare annotation was computed. [2022-02-20 16:49:46,030 INFO L858 garLoopResultBuilder]: For program point L6(lines 6 9) no Hoare annotation was computed. [2022-02-20 16:49:46,033 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-20 16:49:46,034 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:49:46,037 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:49:46,038 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:49:46,038 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:49:46,038 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:49:46,038 WARN L170 areAnnotationChecker]: kzallocFINAL has no Hoare annotation [2022-02-20 16:49:46,038 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-02-20 16:49:46,039 WARN L170 areAnnotationChecker]: kzallocEXIT has no Hoare annotation [2022-02-20 16:49:46,039 WARN L170 areAnnotationChecker]: kzallocEXIT has no Hoare annotation [2022-02-20 16:49:46,039 WARN L170 areAnnotationChecker]: kzallocEXIT has no Hoare annotation [2022-02-20 16:49:46,039 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-02-20 16:49:46,039 WARN L170 areAnnotationChecker]: L85-1 has no Hoare annotation [2022-02-20 16:49:46,039 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2022-02-20 16:49:46,039 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2022-02-20 16:49:46,039 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2022-02-20 16:49:46,039 WARN L170 areAnnotationChecker]: L87 has no Hoare annotation [2022-02-20 16:49:46,039 WARN L170 areAnnotationChecker]: L87 has no Hoare annotation [2022-02-20 16:49:46,039 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-02-20 16:49:46,040 WARN L170 areAnnotationChecker]: L85-1 has no Hoare annotation [2022-02-20 16:49:46,041 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2022-02-20 16:49:46,041 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-02-20 16:49:46,042 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-02-20 16:49:46,042 WARN L170 areAnnotationChecker]: L137 has no Hoare annotation [2022-02-20 16:49:46,042 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-02-20 16:49:46,042 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-02-20 16:49:46,042 WARN L170 areAnnotationChecker]: L137 has no Hoare annotation [2022-02-20 16:49:46,042 WARN L170 areAnnotationChecker]: L137 has no Hoare annotation [2022-02-20 16:49:46,042 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-02-20 16:49:46,042 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-02-20 16:49:46,042 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-02-20 16:49:46,042 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-02-20 16:49:46,042 WARN L170 areAnnotationChecker]: L138 has no Hoare annotation [2022-02-20 16:49:46,042 WARN L170 areAnnotationChecker]: L138 has no Hoare annotation [2022-02-20 16:49:46,042 WARN L170 areAnnotationChecker]: L135 has no Hoare annotation [2022-02-20 16:49:46,042 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-02-20 16:49:46,043 WARN L170 areAnnotationChecker]: L121 has no Hoare annotation [2022-02-20 16:49:46,043 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-02-20 16:49:46,043 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-02-20 16:49:46,043 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:49:46,043 WARN L170 areAnnotationChecker]: L121 has no Hoare annotation [2022-02-20 16:49:46,043 WARN L170 areAnnotationChecker]: L121 has no Hoare annotation [2022-02-20 16:49:46,043 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-02-20 16:49:46,043 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:49:46,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:49:46 BoogieIcfgContainer [2022-02-20 16:49:46,054 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:49:46,055 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:49:46,055 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:49:46,055 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:49:46,055 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:49:43" (3/4) ... [2022-02-20 16:49:46,058 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:49:46,062 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kzalloc [2022-02-20 16:49:46,066 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2022-02-20 16:49:46,066 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-02-20 16:49:46,067 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:49:46,067 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:49:46,086 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(tmp_slot == 0) && !(hp_slot_ptr == 0)) && !(\result == 0)) && used_tmp_slot == 1 [2022-02-20 16:49:46,086 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(tmp_slot == 0) && !(hp_slot_ptr == 0)) && !(\result == 0)) && used_tmp_slot == 1 [2022-02-20 16:49:46,086 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(tmp_slot == 0) && !(hp_slot_ptr == 0)) && !(\result == 0) [2022-02-20 16:49:46,087 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(tmp_slot == 0) && !(hp_slot_ptr == 0)) && !(\result == 0)) && used_tmp_slot == 1 [2022-02-20 16:49:46,087 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(tmp_slot == 0) && !(hp_slot_ptr == 0)) && !(\result == 0)) && used_tmp_slot == 1 [2022-02-20 16:49:46,088 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(tmp_slot == 0) && !(hp_slot_ptr == 0)) && !(\result == 0)) && used_tmp_slot == 1 [2022-02-20 16:49:46,098 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:49:46,098 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:49:46,099 INFO L158 Benchmark]: Toolchain (without parser) took 3404.24ms. Allocated memory was 94.4MB in the beginning and 115.3MB in the end (delta: 21.0MB). Free memory was 62.6MB in the beginning and 53.7MB in the end (delta: 8.9MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2022-02-20 16:49:46,100 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 94.4MB. Free memory is still 49.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:49:46,100 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.33ms. Allocated memory is still 94.4MB. Free memory was 62.4MB in the beginning and 68.0MB in the end (delta: -5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:49:46,100 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.22ms. Allocated memory is still 94.4MB. Free memory was 68.0MB in the beginning and 65.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:49:46,100 INFO L158 Benchmark]: Boogie Preprocessor took 24.33ms. Allocated memory is still 94.4MB. Free memory was 65.9MB in the beginning and 64.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:49:46,101 INFO L158 Benchmark]: RCFGBuilder took 521.66ms. Allocated memory is still 94.4MB. Free memory was 64.4MB in the beginning and 48.8MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 16:49:46,101 INFO L158 Benchmark]: TraceAbstraction took 2436.74ms. Allocated memory was 94.4MB in the beginning and 115.3MB in the end (delta: 21.0MB). Free memory was 48.5MB in the beginning and 57.9MB in the end (delta: -9.4MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2022-02-20 16:49:46,101 INFO L158 Benchmark]: Witness Printer took 43.56ms. Allocated memory is still 115.3MB. Free memory was 57.9MB in the beginning and 53.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:49:46,103 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 94.4MB. Free memory is still 49.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.33ms. Allocated memory is still 94.4MB. Free memory was 62.4MB in the beginning and 68.0MB in the end (delta: -5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.22ms. Allocated memory is still 94.4MB. Free memory was 68.0MB in the beginning and 65.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.33ms. Allocated memory is still 94.4MB. Free memory was 65.9MB in the beginning and 64.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 521.66ms. Allocated memory is still 94.4MB. Free memory was 64.4MB in the beginning and 48.8MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2436.74ms. Allocated memory was 94.4MB in the beginning and 115.3MB in the end (delta: 21.0MB). Free memory was 48.5MB in the beginning and 57.9MB in the end (delta: -9.4MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * Witness Printer took 43.56ms. Allocated memory is still 115.3MB. Free memory was 57.9MB in the beginning and 53.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 8]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 82 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 79 mSDsluCounter, 528 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 411 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 126 IncrementalHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 117 mSDtfsCounter, 126 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 12 PreInvPairs, 15 NumberOfFragments, 117 HoareAnnotationTreeSize, 12 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 18 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 99 NumberOfCodeBlocks, 99 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 284 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 28/28 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: ((!(tmp_slot == 0) && !(hp_slot_ptr == 0)) && !(\result == 0)) && used_tmp_slot == 1 - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: ((!(tmp_slot == 0) && !(hp_slot_ptr == 0)) && !(\result == 0)) && used_tmp_slot == 1 - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: (!(tmp_slot == 0) && !(hp_slot_ptr == 0)) && !(\result == 0) - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: ((!(tmp_slot == 0) && !(hp_slot_ptr == 0)) && !(\result == 0)) && used_tmp_slot == 1 - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: ((!(tmp_slot == 0) && !(hp_slot_ptr == 0)) && !(\result == 0)) && used_tmp_slot == 1 - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: ((!(tmp_slot == 0) && !(hp_slot_ptr == 0)) && !(\result == 0)) && used_tmp_slot == 1 RESULT: Ultimate proved your program to be correct! [2022-02-20 16:49:46,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE