./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_x25.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_x25.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 9ca2eb28b930065096f039703bc8c545a25de7919cc90a3441476b4fab43b08c --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 17:45:46,592 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 17:45:46,594 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 17:45:46,633 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 17:45:46,633 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 17:45:46,636 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 17:45:46,637 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 17:45:46,639 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 17:45:46,641 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 17:45:46,645 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 17:45:46,646 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 17:45:46,646 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 17:45:46,647 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 17:45:46,648 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 17:45:46,650 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 17:45:46,653 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 17:45:46,655 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 17:45:46,656 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 17:45:46,657 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 17:45:46,659 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 17:45:46,662 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 17:45:46,662 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 17:45:46,663 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 17:45:46,664 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 17:45:46,665 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 17:45:46,667 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 17:45:46,667 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 17:45:46,668 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 17:45:46,669 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 17:45:46,669 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 17:45:46,669 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 17:45:46,670 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 17:45:46,671 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 17:45:46,672 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 17:45:46,672 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 17:45:46,673 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 17:45:46,674 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 17:45:46,674 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 17:45:46,674 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 17:45:46,674 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 17:45:46,675 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 17:45:46,676 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-14 17:45:46,695 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 17:45:46,696 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 17:45:46,696 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 17:45:46,696 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 17:45:46,697 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 17:45:46,697 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 17:45:46,697 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 17:45:46,697 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 17:45:46,698 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 17:45:46,698 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 17:45:46,698 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 17:45:46,699 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 17:45:46,699 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 17:45:46,699 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 17:45:46,699 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 17:45:46,699 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 17:45:46,699 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 17:45:46,700 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 17:45:46,700 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 17:45:46,700 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 17:45:46,700 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 17:45:46,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 17:45:46,700 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 17:45:46,700 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 17:45:46,701 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 17:45:46,701 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 17:45:46,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 17:45:46,702 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 17:45:46,702 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 17:45:46,702 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 17:45:46,702 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 17:45:46,703 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9ca2eb28b930065096f039703bc8c545a25de7919cc90a3441476b4fab43b08c [2021-12-14 17:45:46,878 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 17:45:46,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 17:45:46,903 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 17:45:46,904 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 17:45:46,904 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 17:45:46,905 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_x25.ko-entry_point.cil.out.i [2021-12-14 17:45:46,960 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b08de6cbb/26515be88ee04540bf463324f3838595/FLAG9aca2668c [2021-12-14 17:45:47,538 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 17:45:47,538 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_x25.ko-entry_point.cil.out.i [2021-12-14 17:45:47,558 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b08de6cbb/26515be88ee04540bf463324f3838595/FLAG9aca2668c [2021-12-14 17:45:47,733 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b08de6cbb/26515be88ee04540bf463324f3838595 [2021-12-14 17:45:47,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 17:45:47,737 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 17:45:47,737 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 17:45:47,738 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 17:45:47,741 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 17:45:47,741 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 05:45:47" (1/1) ... [2021-12-14 17:45:47,742 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74836000 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:45:47, skipping insertion in model container [2021-12-14 17:45:47,743 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 05:45:47" (1/1) ... [2021-12-14 17:45:47,749 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 17:45:47,813 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 17:45:48,285 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-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_x25.ko-entry_point.cil.out.i[152690,152703] [2021-12-14 17:45:48,442 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 17:45:48,453 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 17:45:48,609 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-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_x25.ko-entry_point.cil.out.i[152690,152703] [2021-12-14 17:45:48,660 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 17:45:48,681 INFO L208 MainTranslator]: Completed translation [2021-12-14 17:45:48,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:45:48 WrapperNode [2021-12-14 17:45:48,682 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 17:45:48,684 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 17:45:48,684 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 17:45:48,684 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 17:45:48,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:45:48" (1/1) ... [2021-12-14 17:45:48,719 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:45:48" (1/1) ... [2021-12-14 17:45:48,771 INFO L137 Inliner]: procedures = 110, calls = 180, calls flagged for inlining = 54, calls inlined = 43, statements flattened = 631 [2021-12-14 17:45:48,772 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 17:45:48,772 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 17:45:48,776 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 17:45:48,776 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 17:45:48,782 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:45:48" (1/1) ... [2021-12-14 17:45:48,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:45:48" (1/1) ... [2021-12-14 17:45:48,787 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:45:48" (1/1) ... [2021-12-14 17:45:48,788 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:45:48" (1/1) ... [2021-12-14 17:45:48,804 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:45:48" (1/1) ... [2021-12-14 17:45:48,808 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:45:48" (1/1) ... [2021-12-14 17:45:48,812 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:45:48" (1/1) ... [2021-12-14 17:45:48,817 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 17:45:48,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 17:45:48,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 17:45:48,818 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 17:45:48,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:45:48" (1/1) ... [2021-12-14 17:45:48,827 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 17:45:48,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 17:45:48,849 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) [2021-12-14 17:45:48,862 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 [2021-12-14 17:45:48,891 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-12-14 17:45:48,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-12-14 17:45:48,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 17:45:48,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-12-14 17:45:48,892 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-12-14 17:45:48,892 INFO L130 BoogieDeclarations]: Found specification of procedure dev_to_hdlc [2021-12-14 17:45:48,892 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_to_hdlc [2021-12-14 17:45:48,892 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2021-12-14 17:45:48,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2021-12-14 17:45:48,892 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-12-14 17:45:48,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-12-14 17:45:48,892 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2021-12-14 17:45:48,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2021-12-14 17:45:48,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 17:45:48,893 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2021-12-14 17:45:48,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2021-12-14 17:45:48,893 INFO L130 BoogieDeclarations]: Found specification of procedure x25_ioctl [2021-12-14 17:45:48,893 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_ioctl [2021-12-14 17:45:48,894 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2021-12-14 17:45:48,894 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2021-12-14 17:45:48,894 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-14 17:45:48,894 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-14 17:45:48,894 INFO L130 BoogieDeclarations]: Found specification of procedure x25_connect_disconnect [2021-12-14 17:45:48,894 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_connect_disconnect [2021-12-14 17:45:48,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 17:45:48,894 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free_int [2021-12-14 17:45:48,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free_int [2021-12-14 17:45:48,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 17:45:48,894 INFO L130 BoogieDeclarations]: Found specification of procedure x25_type_trans [2021-12-14 17:45:48,895 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_type_trans [2021-12-14 17:45:48,895 INFO L130 BoogieDeclarations]: Found specification of procedure x25_xmit [2021-12-14 17:45:48,895 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_xmit [2021-12-14 17:45:48,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 17:45:48,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 17:45:48,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 17:45:48,895 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2021-12-14 17:45:48,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2021-12-14 17:45:48,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 17:45:48,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-14 17:45:48,907 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_zalloc [2021-12-14 17:45:48,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_zalloc [2021-12-14 17:45:48,908 INFO L130 BoogieDeclarations]: Found specification of procedure x25_rx [2021-12-14 17:45:48,908 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_rx [2021-12-14 17:45:48,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 17:45:48,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 17:45:48,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 17:45:49,228 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 17:45:49,229 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 17:45:49,480 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-12-14 17:45:49,688 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 17:45:49,698 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 17:45:49,699 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-14 17:45:49,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 05:45:49 BoogieIcfgContainer [2021-12-14 17:45:49,701 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 17:45:49,702 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 17:45:49,702 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 17:45:49,704 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 17:45:49,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 05:45:47" (1/3) ... [2021-12-14 17:45:49,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@228c529c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 05:45:49, skipping insertion in model container [2021-12-14 17:45:49,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:45:48" (2/3) ... [2021-12-14 17:45:49,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@228c529c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 05:45:49, skipping insertion in model container [2021-12-14 17:45:49,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 05:45:49" (3/3) ... [2021-12-14 17:45:49,707 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_x25.ko-entry_point.cil.out.i [2021-12-14 17:45:49,711 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 17:45:49,712 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 17:45:49,787 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 17:45:49,792 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 [2021-12-14 17:45:49,792 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 17:45:49,806 INFO L276 IsEmpty]: Start isEmpty. Operand has 237 states, 184 states have (on average 1.3804347826086956) internal successors, (254), 190 states have internal predecessors, (254), 35 states have call successors, (35), 17 states have call predecessors, (35), 16 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2021-12-14 17:45:49,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-14 17:45:49,810 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:45:49,811 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 17:45:49,811 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:45:49,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:45:49,814 INFO L85 PathProgramCache]: Analyzing trace with hash 898254007, now seen corresponding path program 1 times [2021-12-14 17:45:49,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:45:49,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582341535] [2021-12-14 17:45:49,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:45:49,821 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:45:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:49,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:45:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:50,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:45:50,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:50,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 17:45:50,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:50,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 17:45:50,023 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:45:50,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582341535] [2021-12-14 17:45:50,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582341535] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:45:50,024 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:45:50,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 17:45:50,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496539472] [2021-12-14 17:45:50,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:45:50,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 17:45:50,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:45:50,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 17:45:50,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-14 17:45:50,048 INFO L87 Difference]: Start difference. First operand has 237 states, 184 states have (on average 1.3804347826086956) internal successors, (254), 190 states have internal predecessors, (254), 35 states have call successors, (35), 17 states have call predecessors, (35), 16 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-14 17:45:50,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:45:50,484 INFO L93 Difference]: Finished difference Result 786 states and 1141 transitions. [2021-12-14 17:45:50,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 17:45:50,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2021-12-14 17:45:50,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:45:50,497 INFO L225 Difference]: With dead ends: 786 [2021-12-14 17:45:50,497 INFO L226 Difference]: Without dead ends: 540 [2021-12-14 17:45:50,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-14 17:45:50,503 INFO L933 BasicCegarLoop]: 308 mSDtfsCounter, 752 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 17:45:50,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [765 Valid, 702 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 17:45:50,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2021-12-14 17:45:50,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 432. [2021-12-14 17:45:50,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 341 states have (on average 1.3284457478005864) internal successors, (453), 343 states have internal predecessors, (453), 60 states have call successors, (60), 31 states have call predecessors, (60), 30 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2021-12-14 17:45:50,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 572 transitions. [2021-12-14 17:45:50,588 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 572 transitions. Word has length 33 [2021-12-14 17:45:50,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:45:50,589 INFO L470 AbstractCegarLoop]: Abstraction has 432 states and 572 transitions. [2021-12-14 17:45:50,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-14 17:45:50,589 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 572 transitions. [2021-12-14 17:45:50,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-14 17:45:50,591 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:45:50,591 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 17:45:50,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 17:45:50,592 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:45:50,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:45:50,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1941540429, now seen corresponding path program 1 times [2021-12-14 17:45:50,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:45:50,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120350582] [2021-12-14 17:45:50,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:45:50,593 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:45:50,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:50,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:45:50,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:50,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:45:50,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:50,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 17:45:50,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:50,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 17:45:50,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:45:50,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120350582] [2021-12-14 17:45:50,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120350582] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:45:50,669 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:45:50,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 17:45:50,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398966231] [2021-12-14 17:45:50,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:45:50,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 17:45:50,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:45:50,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 17:45:50,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 17:45:50,671 INFO L87 Difference]: Start difference. First operand 432 states and 572 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-14 17:45:50,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:45:50,956 INFO L93 Difference]: Finished difference Result 965 states and 1293 transitions. [2021-12-14 17:45:50,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 17:45:50,956 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2021-12-14 17:45:50,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:45:50,959 INFO L225 Difference]: With dead ends: 965 [2021-12-14 17:45:50,960 INFO L226 Difference]: Without dead ends: 539 [2021-12-14 17:45:50,961 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-12-14 17:45:50,962 INFO L933 BasicCegarLoop]: 331 mSDtfsCounter, 613 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 17:45:50,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [620 Valid, 750 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 17:45:50,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2021-12-14 17:45:50,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 431. [2021-12-14 17:45:50,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 340 states have (on average 1.3205882352941176) internal successors, (449), 342 states have internal predecessors, (449), 60 states have call successors, (60), 31 states have call predecessors, (60), 30 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2021-12-14 17:45:50,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 568 transitions. [2021-12-14 17:45:50,985 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 568 transitions. Word has length 36 [2021-12-14 17:45:50,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:45:50,986 INFO L470 AbstractCegarLoop]: Abstraction has 431 states and 568 transitions. [2021-12-14 17:45:50,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-14 17:45:50,986 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 568 transitions. [2021-12-14 17:45:50,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-12-14 17:45:50,989 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:45:50,989 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 17:45:50,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 17:45:50,989 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:45:50,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:45:50,990 INFO L85 PathProgramCache]: Analyzing trace with hash 2029658452, now seen corresponding path program 1 times [2021-12-14 17:45:50,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:45:50,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205880300] [2021-12-14 17:45:50,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:45:50,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:45:51,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:51,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:45:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:51,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:45:51,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:51,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 17:45:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:51,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-14 17:45:51,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:51,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:45:51,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:51,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 17:45:51,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:51,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-14 17:45:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:51,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:45:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:51,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 17:45:51,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:51,119 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-12-14 17:45:51,120 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:45:51,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205880300] [2021-12-14 17:45:51,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205880300] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:45:51,120 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:45:51,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 17:45:51,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795578183] [2021-12-14 17:45:51,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:45:51,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 17:45:51,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:45:51,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 17:45:51,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-14 17:45:51,122 INFO L87 Difference]: Start difference. First operand 431 states and 568 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-14 17:45:51,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:45:51,688 INFO L93 Difference]: Finished difference Result 1462 states and 2036 transitions. [2021-12-14 17:45:51,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 17:45:51,688 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2021-12-14 17:45:51,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:45:51,693 INFO L225 Difference]: With dead ends: 1462 [2021-12-14 17:45:51,693 INFO L226 Difference]: Without dead ends: 1032 [2021-12-14 17:45:51,695 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-12-14 17:45:51,695 INFO L933 BasicCegarLoop]: 296 mSDtfsCounter, 514 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 17:45:51,696 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [523 Valid, 1319 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 17:45:51,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2021-12-14 17:45:51,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 840. [2021-12-14 17:45:51,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 840 states, 661 states have (on average 1.3222390317700454) internal successors, (874), 665 states have internal predecessors, (874), 118 states have call successors, (118), 61 states have call predecessors, (118), 60 states have return successors, (145), 117 states have call predecessors, (145), 117 states have call successors, (145) [2021-12-14 17:45:51,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1137 transitions. [2021-12-14 17:45:51,732 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1137 transitions. Word has length 77 [2021-12-14 17:45:51,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:45:51,732 INFO L470 AbstractCegarLoop]: Abstraction has 840 states and 1137 transitions. [2021-12-14 17:45:51,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-14 17:45:51,733 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1137 transitions. [2021-12-14 17:45:51,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-12-14 17:45:51,739 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:45:51,739 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 17:45:51,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 17:45:51,740 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:45:51,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:45:51,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1596249494, now seen corresponding path program 1 times [2021-12-14 17:45:51,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:45:51,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200609845] [2021-12-14 17:45:51,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:45:51,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:45:51,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:51,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:45:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:51,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:45:51,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:51,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 17:45:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:51,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-14 17:45:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:51,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:45:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:51,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 17:45:51,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:51,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-14 17:45:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:51,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:45:51,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:51,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 17:45:51,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:51,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-14 17:45:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:51,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:45:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:51,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-14 17:45:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:51,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 17:45:51,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:51,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:45:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:51,879 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-12-14 17:45:51,879 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:45:51,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200609845] [2021-12-14 17:45:51,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200609845] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:45:51,880 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:45:51,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 17:45:51,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310046911] [2021-12-14 17:45:51,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:45:51,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 17:45:51,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:45:51,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 17:45:51,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-12-14 17:45:51,882 INFO L87 Difference]: Start difference. First operand 840 states and 1137 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (11), 6 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-14 17:45:52,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:45:52,616 INFO L93 Difference]: Finished difference Result 2912 states and 3997 transitions. [2021-12-14 17:45:52,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 17:45:52,617 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (11), 6 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 119 [2021-12-14 17:45:52,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:45:52,638 INFO L225 Difference]: With dead ends: 2912 [2021-12-14 17:45:52,638 INFO L226 Difference]: Without dead ends: 2078 [2021-12-14 17:45:52,643 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-12-14 17:45:52,646 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 577 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-14 17:45:52,647 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [588 Valid, 1166 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-14 17:45:52,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2078 states. [2021-12-14 17:45:52,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2078 to 1662. [2021-12-14 17:45:52,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1662 states, 1311 states have (on average 1.297482837528604) internal successors, (1701), 1319 states have internal predecessors, (1701), 210 states have call successors, (210), 121 states have call predecessors, (210), 140 states have return successors, (297), 229 states have call predecessors, (297), 209 states have call successors, (297) [2021-12-14 17:45:52,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 2208 transitions. [2021-12-14 17:45:52,743 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 2208 transitions. Word has length 119 [2021-12-14 17:45:52,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:45:52,743 INFO L470 AbstractCegarLoop]: Abstraction has 1662 states and 2208 transitions. [2021-12-14 17:45:52,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (11), 6 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-14 17:45:52,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2208 transitions. [2021-12-14 17:45:52,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-12-14 17:45:52,747 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:45:52,747 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 17:45:52,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 17:45:52,748 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:45:52,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:45:52,748 INFO L85 PathProgramCache]: Analyzing trace with hash 162596766, now seen corresponding path program 1 times [2021-12-14 17:45:52,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:45:52,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565621250] [2021-12-14 17:45:52,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:45:52,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:45:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:52,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:45:52,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:52,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:45:52,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:52,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 17:45:52,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:52,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-14 17:45:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:52,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:45:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:52,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 17:45:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:52,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-14 17:45:52,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:52,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:45:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:52,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 17:45:52,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:52,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-12-14 17:45:52,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:52,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:45:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:52,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-14 17:45:52,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:52,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 17:45:52,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:52,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:45:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:52,873 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-12-14 17:45:52,873 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:45:52,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565621250] [2021-12-14 17:45:52,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565621250] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:45:52,874 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:45:52,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 17:45:52,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175775114] [2021-12-14 17:45:52,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:45:52,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 17:45:52,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:45:52,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 17:45:52,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-12-14 17:45:52,875 INFO L87 Difference]: Start difference. First operand 1662 states and 2208 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (11), 6 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2021-12-14 17:45:53,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:45:53,238 INFO L93 Difference]: Finished difference Result 2954 states and 4105 transitions. [2021-12-14 17:45:53,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 17:45:53,238 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (11), 6 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 119 [2021-12-14 17:45:53,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:45:53,245 INFO L225 Difference]: With dead ends: 2954 [2021-12-14 17:45:53,245 INFO L226 Difference]: Without dead ends: 2070 [2021-12-14 17:45:53,248 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-12-14 17:45:53,248 INFO L933 BasicCegarLoop]: 272 mSDtfsCounter, 163 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 1038 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 17:45:53,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 1038 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 17:45:53,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2070 states. [2021-12-14 17:45:53,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2070 to 1670. [2021-12-14 17:45:53,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1670 states, 1319 states have (on average 1.2956785443517818) internal successors, (1709), 1327 states have internal predecessors, (1709), 210 states have call successors, (210), 121 states have call predecessors, (210), 140 states have return successors, (297), 229 states have call predecessors, (297), 209 states have call successors, (297) [2021-12-14 17:45:53,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 2216 transitions. [2021-12-14 17:45:53,300 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 2216 transitions. Word has length 119 [2021-12-14 17:45:53,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:45:53,301 INFO L470 AbstractCegarLoop]: Abstraction has 1670 states and 2216 transitions. [2021-12-14 17:45:53,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (11), 6 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2021-12-14 17:45:53,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 2216 transitions. [2021-12-14 17:45:53,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-12-14 17:45:53,304 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:45:53,304 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 17:45:53,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 17:45:53,305 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:45:53,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:45:53,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1319541292, now seen corresponding path program 1 times [2021-12-14 17:45:53,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:45:53,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576868315] [2021-12-14 17:45:53,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:45:53,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:45:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:53,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:45:53,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:53,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:45:53,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:53,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 17:45:53,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:53,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-14 17:45:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:53,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:45:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:53,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 17:45:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:53,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-14 17:45:53,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:53,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:45:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:53,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 17:45:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:53,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-12-14 17:45:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:53,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:45:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:53,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-14 17:45:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:53,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-14 17:45:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:53,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 17:45:53,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:53,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:45:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:53,485 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-12-14 17:45:53,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:45:53,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576868315] [2021-12-14 17:45:53,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576868315] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:45:53,486 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:45:53,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-14 17:45:53,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201183417] [2021-12-14 17:45:53,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:45:53,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-14 17:45:53,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:45:53,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-14 17:45:53,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-12-14 17:45:53,487 INFO L87 Difference]: Start difference. First operand 1670 states and 2216 transitions. Second operand has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-14 17:45:54,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:45:54,844 INFO L93 Difference]: Finished difference Result 4250 states and 5733 transitions. [2021-12-14 17:45:54,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-14 17:45:54,845 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) Word has length 127 [2021-12-14 17:45:54,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:45:54,854 INFO L225 Difference]: With dead ends: 4250 [2021-12-14 17:45:54,855 INFO L226 Difference]: Without dead ends: 2586 [2021-12-14 17:45:54,860 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2021-12-14 17:45:54,860 INFO L933 BasicCegarLoop]: 315 mSDtfsCounter, 1405 mSDsluCounter, 1385 mSDsCounter, 0 mSdLazyCounter, 1465 mSolverCounterSat, 621 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1421 SdHoareTripleChecker+Valid, 1700 SdHoareTripleChecker+Invalid, 2086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 621 IncrementalHoareTripleChecker+Valid, 1465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-14 17:45:54,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1421 Valid, 1700 Invalid, 2086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [621 Valid, 1465 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-14 17:45:54,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2586 states. [2021-12-14 17:45:54,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2586 to 1698. [2021-12-14 17:45:54,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1698 states, 1335 states have (on average 1.2831460674157302) internal successors, (1713), 1347 states have internal predecessors, (1713), 222 states have call successors, (222), 125 states have call predecessors, (222), 140 states have return successors, (257), 233 states have call predecessors, (257), 221 states have call successors, (257) [2021-12-14 17:45:54,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1698 states and 2192 transitions. [2021-12-14 17:45:54,927 INFO L78 Accepts]: Start accepts. Automaton has 1698 states and 2192 transitions. Word has length 127 [2021-12-14 17:45:54,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:45:54,928 INFO L470 AbstractCegarLoop]: Abstraction has 1698 states and 2192 transitions. [2021-12-14 17:45:54,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-14 17:45:54,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1698 states and 2192 transitions. [2021-12-14 17:45:54,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-12-14 17:45:54,932 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:45:54,932 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 17:45:54,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 17:45:54,932 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:45:54,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:45:54,933 INFO L85 PathProgramCache]: Analyzing trace with hash -239915446, now seen corresponding path program 1 times [2021-12-14 17:45:54,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:45:54,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177224504] [2021-12-14 17:45:54,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:45:54,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:45:54,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:55,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:45:55,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:55,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:45:55,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:55,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 17:45:55,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:55,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-14 17:45:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:55,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:45:55,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:55,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 17:45:55,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:55,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-14 17:45:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:55,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:45:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:55,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 17:45:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:55,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-12-14 17:45:55,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:55,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:45:55,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:55,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-14 17:45:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:55,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-14 17:45:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:55,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:45:55,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:55,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:45:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:55,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:45:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:55,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 17:45:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:55,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-14 17:45:55,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:55,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:45:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:55,247 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2021-12-14 17:45:55,247 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:45:55,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177224504] [2021-12-14 17:45:55,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177224504] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:45:55,248 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:45:55,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-14 17:45:55,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28948575] [2021-12-14 17:45:55,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:45:55,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-14 17:45:55,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:45:55,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-14 17:45:55,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-12-14 17:45:55,249 INFO L87 Difference]: Start difference. First operand 1698 states and 2192 transitions. Second operand has 13 states, 13 states have (on average 6.0) internal successors, (78), 9 states have internal predecessors, (78), 5 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (13), 8 states have call predecessors, (13), 4 states have call successors, (13) [2021-12-14 17:45:57,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:45:57,146 INFO L93 Difference]: Finished difference Result 4534 states and 6177 transitions. [2021-12-14 17:45:57,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-12-14 17:45:57,147 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 9 states have internal predecessors, (78), 5 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (13), 8 states have call predecessors, (13), 4 states have call successors, (13) Word has length 151 [2021-12-14 17:45:57,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:45:57,164 INFO L225 Difference]: With dead ends: 4534 [2021-12-14 17:45:57,164 INFO L226 Difference]: Without dead ends: 3606 [2021-12-14 17:45:57,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=272, Invalid=988, Unknown=0, NotChecked=0, Total=1260 [2021-12-14 17:45:57,170 INFO L933 BasicCegarLoop]: 520 mSDtfsCounter, 2065 mSDsluCounter, 2058 mSDsCounter, 0 mSdLazyCounter, 2219 mSolverCounterSat, 1028 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2103 SdHoareTripleChecker+Valid, 2578 SdHoareTripleChecker+Invalid, 3247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1028 IncrementalHoareTripleChecker+Valid, 2219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-12-14 17:45:57,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2103 Valid, 2578 Invalid, 3247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1028 Valid, 2219 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-12-14 17:45:57,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3606 states. [2021-12-14 17:45:57,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3606 to 2234. [2021-12-14 17:45:57,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2234 states, 1731 states have (on average 1.2576545349508954) internal successors, (2177), 1755 states have internal predecessors, (2177), 266 states have call successors, (266), 153 states have call predecessors, (266), 236 states have return successors, (429), 333 states have call predecessors, (429), 265 states have call successors, (429) [2021-12-14 17:45:57,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 2872 transitions. [2021-12-14 17:45:57,340 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 2872 transitions. Word has length 151 [2021-12-14 17:45:57,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:45:57,340 INFO L470 AbstractCegarLoop]: Abstraction has 2234 states and 2872 transitions. [2021-12-14 17:45:57,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 9 states have internal predecessors, (78), 5 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (13), 8 states have call predecessors, (13), 4 states have call successors, (13) [2021-12-14 17:45:57,341 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 2872 transitions. [2021-12-14 17:45:57,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-12-14 17:45:57,344 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:45:57,345 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 17:45:57,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 17:45:57,345 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:45:57,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:45:57,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1665675225, now seen corresponding path program 1 times [2021-12-14 17:45:57,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:45:57,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129107561] [2021-12-14 17:45:57,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:45:57,347 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:45:57,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:57,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:45:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:57,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:45:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:57,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 17:45:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:57,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-14 17:45:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:57,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:45:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:57,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 17:45:57,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:57,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-14 17:45:57,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:57,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:45:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:57,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 17:45:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:57,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-12-14 17:45:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:57,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:45:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:57,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-14 17:45:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:57,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 17:45:57,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:57,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:45:57,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:57,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:45:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:57,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:45:57,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:57,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 17:45:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:57,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-14 17:45:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:57,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:45:57,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:45:57,554 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2021-12-14 17:45:57,554 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:45:57,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129107561] [2021-12-14 17:45:57,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129107561] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:45:57,555 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:45:57,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 17:45:57,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696971866] [2021-12-14 17:45:57,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:45:57,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 17:45:57,555 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:45:57,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 17:45:57,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-14 17:45:57,556 INFO L87 Difference]: Start difference. First operand 2234 states and 2872 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2021-12-14 17:45:57,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:45:57,972 INFO L93 Difference]: Finished difference Result 4214 states and 5577 transitions. [2021-12-14 17:45:57,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 17:45:57,972 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 152 [2021-12-14 17:45:57,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:45:57,989 INFO L225 Difference]: With dead ends: 4214 [2021-12-14 17:45:57,989 INFO L226 Difference]: Without dead ends: 2818 [2021-12-14 17:45:57,993 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-12-14 17:45:57,995 INFO L933 BasicCegarLoop]: 263 mSDtfsCounter, 282 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 17:45:57,995 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [288 Valid, 1102 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 17:45:57,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states. [2021-12-14 17:45:58,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2234. [2021-12-14 17:45:58,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2234 states, 1731 states have (on average 1.2484113229347198) internal successors, (2161), 1755 states have internal predecessors, (2161), 266 states have call successors, (266), 153 states have call predecessors, (266), 236 states have return successors, (429), 333 states have call predecessors, (429), 265 states have call successors, (429) [2021-12-14 17:45:58,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 2856 transitions. [2021-12-14 17:45:58,083 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 2856 transitions. Word has length 152 [2021-12-14 17:45:58,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:45:58,084 INFO L470 AbstractCegarLoop]: Abstraction has 2234 states and 2856 transitions. [2021-12-14 17:45:58,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2021-12-14 17:45:58,084 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 2856 transitions. [2021-12-14 17:45:58,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-12-14 17:45:58,087 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:45:58,088 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 17:45:58,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 17:45:58,088 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:45:58,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:45:58,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1648213824, now seen corresponding path program 1 times [2021-12-14 17:45:58,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:45:58,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235053622] [2021-12-14 17:45:58,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:45:58,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:45:58,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 17:45:58,176 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 17:45:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 17:45:58,360 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 17:45:58,360 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-14 17:45:58,361 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-14 17:45:58,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-14 17:45:58,365 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 17:45:58,382 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 17:45:58,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 05:45:58 BoogieIcfgContainer [2021-12-14 17:45:58,529 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 17:45:58,530 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 17:45:58,530 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 17:45:58,530 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 17:45:58,530 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 05:45:49" (3/4) ... [2021-12-14 17:45:58,531 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-14 17:45:58,598 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-14 17:45:58,598 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 17:45:58,599 INFO L158 Benchmark]: Toolchain (without parser) took 10862.38ms. Allocated memory was 146.8MB in the beginning and 494.9MB in the end (delta: 348.1MB). Free memory was 116.1MB in the beginning and 367.0MB in the end (delta: -251.0MB). Peak memory consumption was 96.6MB. Max. memory is 16.1GB. [2021-12-14 17:45:58,599 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 146.8MB. Free memory is still 104.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 17:45:58,599 INFO L158 Benchmark]: CACSL2BoogieTranslator took 945.57ms. Allocated memory was 146.8MB in the beginning and 213.9MB in the end (delta: 67.1MB). Free memory was 115.6MB in the beginning and 150.0MB in the end (delta: -34.4MB). Peak memory consumption was 68.3MB. Max. memory is 16.1GB. [2021-12-14 17:45:58,600 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.30ms. Allocated memory is still 213.9MB. Free memory was 150.0MB in the beginning and 145.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-14 17:45:58,600 INFO L158 Benchmark]: Boogie Preprocessor took 45.32ms. Allocated memory is still 213.9MB. Free memory was 145.8MB in the beginning and 140.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-14 17:45:58,600 INFO L158 Benchmark]: RCFGBuilder took 882.63ms. Allocated memory is still 213.9MB. Free memory was 140.6MB in the beginning and 98.6MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2021-12-14 17:45:58,600 INFO L158 Benchmark]: TraceAbstraction took 8827.41ms. Allocated memory was 213.9MB in the beginning and 494.9MB in the end (delta: 281.0MB). Free memory was 98.6MB in the beginning and 389.0MB in the end (delta: -290.4MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 17:45:58,600 INFO L158 Benchmark]: Witness Printer took 68.95ms. Allocated memory is still 494.9MB. Free memory was 389.0MB in the beginning and 367.0MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2021-12-14 17:45:58,601 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 146.8MB. Free memory is still 104.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 945.57ms. Allocated memory was 146.8MB in the beginning and 213.9MB in the end (delta: 67.1MB). Free memory was 115.6MB in the beginning and 150.0MB in the end (delta: -34.4MB). Peak memory consumption was 68.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.30ms. Allocated memory is still 213.9MB. Free memory was 150.0MB in the beginning and 145.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.32ms. Allocated memory is still 213.9MB. Free memory was 145.8MB in the beginning and 140.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 882.63ms. Allocated memory is still 213.9MB. Free memory was 140.6MB in the beginning and 98.6MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8827.41ms. Allocated memory was 213.9MB in the beginning and 494.9MB in the end (delta: 281.0MB). Free memory was 98.6MB in the beginning and 389.0MB in the end (delta: -290.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 68.95ms. Allocated memory is still 494.9MB. Free memory was 389.0MB in the beginning and 367.0MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 5320]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L5343] int LDV_IN_INTERRUPT = 1; [L5344] struct sk_buff *proto_group0 ; [L5345] int ref_cnt ; [L5346] int ldv_state_variable_1 ; [L5347] struct net_device *proto_group1 ; [L5348] int ldv_state_variable_0 ; [L5564-L5566] static struct hdlc_proto proto = {& x25_open, & x25_close, 0, 0, 0, & x25_ioctl, 0, & x25_rx, & x25_xmit, & __this_module, 0}; [L5633] int ldv_retval_0 ; [L5634] int ldv_retval_1 ; [L5837] Element set_impl[15] ; [L5838] int last_index = 0; [L5972] Set LDV_SKBS ; VAL [__this_module={18446744073709551621:18446744073709551620}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, proto={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8:0}] [L5651] struct ifreq *ldvarg0 ; [L5652] void *tmp ; [L5653] int tmp___0 ; [L5654] int tmp___1 ; [L5655] int tmp___2 ; VAL [__this_module={18446744073709551621:18446744073709551620}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, proto={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8:0}] [L5657] CALL, EXPR ldv_successful_zalloc(40UL) VAL [\old(__size)=40, __this_module={18446744073709551621:18446744073709551620}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, proto={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8:0}] [L5262] EXPR, FCALL calloc(1UL, __size) VAL [\old(__size)=40, __size=40, __this_module={18446744073709551621:18446744073709551620}, calloc(1UL, __size)={-2:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, proto={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8:0}] [L5262] void *p = calloc(1UL, __size); VAL [\old(__size)=40, __size=40, __this_module={18446744073709551621:18446744073709551620}, calloc(1UL, __size)={-2:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, p={-2:0}, proto={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8:0}] [L5263] CALL assume_abort_if_not(p != (void *)0) VAL [\old(cond)=1, __this_module={18446744073709551621:18446744073709551620}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, proto={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8:0}] [L5259] COND FALSE !(!cond) VAL [\old(cond)=1, __this_module={18446744073709551621:18446744073709551620}, cond=1, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, proto={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8:0}] [L5263] RET assume_abort_if_not(p != (void *)0) VAL [\old(__size)=40, __size=40, __this_module={18446744073709551621:18446744073709551620}, calloc(1UL, __size)={-2:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, p={-2:0}, proto={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8:0}] [L5264] return p; VAL [\old(__size)=40, \result={-2:0}, __size=40, __this_module={18446744073709551621:18446744073709551620}, calloc(1UL, __size)={-2:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, p={-2:0}, proto={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8:0}] [L5657] RET, EXPR ldv_successful_zalloc(40UL) VAL [__this_module={18446744073709551621:18446744073709551620}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_successful_zalloc(40UL)={-2:0}, proto={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8:0}] [L5657] tmp = ldv_successful_zalloc(40UL) [L5658] ldvarg0 = (struct ifreq *)tmp [L5659] CALL ldv_initialize() [L5991] CALL ldv_set_init(LDV_SKBS) [L5843] set = set_impl [L5844] last_index = 0 VAL [__this_module={18446744073709551621:18446744073709551620}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, proto={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set={8:0}, set={0:0}, set_impl={8:0}] [L5991] RET ldv_set_init(LDV_SKBS) [L5659] RET ldv_initialize() [L5660] ldv_state_variable_1 = 0 [L5661] ref_cnt = 0 [L5662] ldv_state_variable_0 = 1 VAL [__this_module={18446744073709551621:18446744073709551620}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ldvarg0={-2:0}, proto={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8:0}, tmp={-2:0}] [L5664] tmp___0 = __VERIFIER_nondet_int() [L5666] case 0: [L5731] case 1: VAL [__this_module={18446744073709551621:18446744073709551620}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ldvarg0={-2:0}, proto={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8:0}, tmp={-2:0}, tmp___0=1] [L5732] COND TRUE ldv_state_variable_0 != 0 [L5733] tmp___2 = __VERIFIER_nondet_int() [L5735] case 0: [L5743] case 1: VAL [__this_module={18446744073709551621:18446744073709551620}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ldvarg0={-2:0}, proto={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8:0}, tmp={-2:0}, tmp___0=1, tmp___2=1] [L5744] COND TRUE ldv_state_variable_0 == 1 [L5745] CALL, EXPR mod_init() [L5622] FCALL register_hdlc_protocol(& proto) [L5623] return (0); VAL [\result=0, __this_module={18446744073709551621:18446744073709551620}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, proto={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8:0}] [L5745] RET, EXPR mod_init() [L5745] ldv_retval_1 = mod_init() [L5746] COND TRUE ldv_retval_1 == 0 [L5747] ldv_state_variable_0 = 3 [L5748] ldv_state_variable_1 = 1 [L5749] CALL ldv_initialize_hdlc_proto_1() [L5639] void *tmp ; [L5640] void *tmp___0 ; VAL [__this_module={18446744073709551621:18446744073709551620}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8:0}] [L5642] CALL, EXPR ldv_successful_zalloc(3264UL) VAL [\old(__size)=3264, __this_module={18446744073709551621:18446744073709551620}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8:0}] [L5262] EXPR, FCALL calloc(1UL, __size) VAL [\old(__size)=3264, __size=3264, __this_module={18446744073709551621:18446744073709551620}, calloc(1UL, __size)={-3:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8:0}] [L5262] void *p = calloc(1UL, __size); VAL [\old(__size)=3264, __size=3264, __this_module={18446744073709551621:18446744073709551620}, calloc(1UL, __size)={-3:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-3:0}, proto={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8:0}] [L5263] CALL assume_abort_if_not(p != (void *)0) VAL [\old(cond)=1, __this_module={18446744073709551621:18446744073709551620}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8:0}] [L5259] COND FALSE !(!cond) VAL [\old(cond)=1, __this_module={18446744073709551621:18446744073709551620}, cond=1, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8:0}] [L5263] RET assume_abort_if_not(p != (void *)0) VAL [\old(__size)=3264, __size=3264, __this_module={18446744073709551621:18446744073709551620}, calloc(1UL, __size)={-3:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-3:0}, proto={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8:0}] [L5264] return p; VAL [\old(__size)=3264, \result={-3:0}, __size=3264, __this_module={18446744073709551621:18446744073709551620}, calloc(1UL, __size)={-3:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-3:0}, proto={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8:0}] [L5642] RET, EXPR ldv_successful_zalloc(3264UL) VAL [__this_module={18446744073709551621:18446744073709551620}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_successful_zalloc(3264UL)={-3:0}, proto={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8:0}] [L5642] tmp = ldv_successful_zalloc(3264UL) [L5643] proto_group1 = (struct net_device *)tmp VAL [__this_module={18446744073709551621:18446744073709551620}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, tmp={-3:0}] [L5644] CALL, EXPR ldv_successful_zalloc(232UL) VAL [\old(__size)=232, __this_module={18446744073709551621:18446744073709551620}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5262] EXPR, FCALL calloc(1UL, __size) VAL [\old(__size)=232, __size=232, __this_module={18446744073709551621:18446744073709551620}, calloc(1UL, __size)={18446744073709551617:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5262] void *p = calloc(1UL, __size); VAL [\old(__size)=232, __size=232, __this_module={18446744073709551621:18446744073709551620}, calloc(1UL, __size)={18446744073709551617:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, p={18446744073709551617:0}, proto={7:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5263] CALL assume_abort_if_not(p != (void *)0) VAL [\old(cond)=1, __this_module={18446744073709551621:18446744073709551620}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5259] COND FALSE !(!cond) VAL [\old(cond)=1, __this_module={18446744073709551621:18446744073709551620}, cond=1, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5263] RET assume_abort_if_not(p != (void *)0) VAL [\old(__size)=232, __size=232, __this_module={18446744073709551621:18446744073709551620}, calloc(1UL, __size)={18446744073709551617:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, p={18446744073709551617:0}, proto={7:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5264] return p; VAL [\old(__size)=232, \result={18446744073709551617:0}, __size=232, __this_module={18446744073709551621:18446744073709551620}, calloc(1UL, __size)={18446744073709551617:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, p={18446744073709551617:0}, proto={7:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5644] RET, EXPR ldv_successful_zalloc(232UL) VAL [__this_module={18446744073709551621:18446744073709551620}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_successful_zalloc(232UL)={18446744073709551617:0}, proto={7:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, tmp={-3:0}] [L5644] tmp___0 = ldv_successful_zalloc(232UL) [L5645] proto_group0 = (struct sk_buff *)tmp___0 VAL [__this_module={18446744073709551621:18446744073709551620}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, tmp={-3:0}, tmp___0={18446744073709551617:0}] [L5749] RET ldv_initialize_hdlc_proto_1() [L5752] COND FALSE !(ldv_retval_1 != 0) VAL [__this_module={18446744073709551621:18446744073709551620}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-2:0}, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, tmp={-2:0}, tmp___0=1, tmp___2=1] [L5664] tmp___0 = __VERIFIER_nondet_int() [L5666] case 0: VAL [__this_module={18446744073709551621:18446744073709551620}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-2:0}, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, tmp={-2:0}, tmp___0=0, tmp___2=1] [L5667] COND TRUE ldv_state_variable_1 != 0 [L5668] tmp___1 = __VERIFIER_nondet_int() [L5670] case 0: VAL [__this_module={18446744073709551621:18446744073709551620}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-2:0}, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, tmp={-2:0}, tmp___0=0, tmp___1=0, tmp___2=1] [L5671] COND TRUE ldv_state_variable_1 == 1 VAL [__this_module={18446744073709551621:18446744073709551620}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-2:0}, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, tmp={-2:0}, tmp___0=0, tmp___1=0, tmp___2=1] [L5672] CALL x25_xmit(proto_group0, proto_group1) VAL [\old(last_index)=0, __this_module={18446744073709551621:18446744073709551620}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5471] int result ; VAL [\old(last_index)=0, __this_module={18446744073709551621:18446744073709551620}, dev={-3:0}, dev={-3:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, skb={18446744073709551617:0}, skb={18446744073709551617:0}] [L5473] CALL assume_abort_if_not(((void*)(skb)) != ((void*) 0)) VAL [\old(cond)=1, \old(last_index)=0, __this_module={18446744073709551621:18446744073709551620}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5259] COND FALSE !(!cond) VAL [\old(cond)=1, \old(last_index)=0, __this_module={18446744073709551621:18446744073709551620}, cond=1, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5473] RET assume_abort_if_not(((void*)(skb)) != ((void*) 0)) VAL [\old(last_index)=0, __this_module={18446744073709551621:18446744073709551620}, dev={-3:0}, dev={-3:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, skb={18446744073709551617:0}, skb={18446744073709551617:0}] [L5474] EXPR skb->data VAL [\old(last_index)=0, __this_module={18446744073709551621:18446744073709551620}, dev={-3:0}, dev={-3:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, skb={18446744073709551617:0}, skb={18446744073709551617:0}, skb->data={0:18446744073709551619}] [L5474] CALL assume_abort_if_not(((void*)((skb->data))) != ((void*) 0)) VAL [\old(cond)=1, \old(last_index)=0, __this_module={18446744073709551621:18446744073709551620}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5259] COND FALSE !(!cond) VAL [\old(cond)=1, \old(last_index)=0, __this_module={18446744073709551621:18446744073709551620}, cond=1, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5474] RET assume_abort_if_not(((void*)((skb->data))) != ((void*) 0)) VAL [\old(last_index)=0, __this_module={18446744073709551621:18446744073709551620}, dev={-3:0}, dev={-3:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, skb={18446744073709551617:0}, skb={18446744073709551617:0}, skb->data={0:18446744073709551619}] [L5475] skb->data [L5476] case 0: [L5484] case 1: [L5485] CALL, EXPR lapb_connect_request(dev) [L6068] return __VERIFIER_nondet_int(); [L5485] RET, EXPR lapb_connect_request(dev) [L5485] result = lapb_connect_request(dev) [L5486] COND TRUE result != 0 VAL [\old(last_index)=0, __this_module={18446744073709551621:18446744073709551620}, dev={-3:0}, dev={-3:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, result=3, set_impl={8:0}, skb={18446744073709551617:0}, skb={18446744073709551617:0}, skb->data={0:18446744073709551619}skb->data=257] [L5487] COND TRUE result == 3 [L5488] CALL x25_connected(dev, 0) [L5428] CALL x25_connect_disconnect(dev, reason, 1) VAL [\old(last_index)=0, __this_module={18446744073709551621:18446744073709551620}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5409] struct sk_buff *skb ; [L5410] unsigned char *ptr ; [L5412] CALL, EXPR ldv_dev_alloc_skb_12(1U) [L5814] struct sk_buff *tmp ; VAL [\old(last_index)=0, \old(length)=1, __this_module={18446744073709551621:18446744073709551620}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, length=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5816] CALL, EXPR ldv_skb_alloc() VAL [\old(last_index)=0, __this_module={18446744073709551621:18446744073709551620}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5975] void *skb ; [L5976] void *tmp___7 ; VAL [\old(last_index)=0, __this_module={18446744073709551621:18446744073709551620}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5978] CALL, EXPR ldv_successful_zalloc(sizeof(struct sk_buff___0 )) VAL [\old(__size)=248, \old(last_index)=0, __this_module={18446744073709551621:18446744073709551620}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5262] EXPR, FCALL calloc(1UL, __size) VAL [\old(__size)=248, \old(last_index)=0, __size=248, __this_module={18446744073709551621:18446744073709551620}, calloc(1UL, __size)={18446744073709551616:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5262] void *p = calloc(1UL, __size); VAL [\old(__size)=248, \old(last_index)=0, __size=248, __this_module={18446744073709551621:18446744073709551620}, calloc(1UL, __size)={18446744073709551616:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, p={18446744073709551616:0}, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5263] CALL assume_abort_if_not(p != (void *)0) VAL [\old(cond)=1, \old(last_index)=0, __this_module={18446744073709551621:18446744073709551620}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5259] COND FALSE !(!cond) VAL [\old(cond)=1, \old(last_index)=0, __this_module={18446744073709551621:18446744073709551620}, cond=1, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5263] RET assume_abort_if_not(p != (void *)0) VAL [\old(__size)=248, \old(last_index)=0, __size=248, __this_module={18446744073709551621:18446744073709551620}, calloc(1UL, __size)={18446744073709551616:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, p={18446744073709551616:0}, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5264] return p; VAL [\old(__size)=248, \old(last_index)=0, \result={18446744073709551616:0}, __size=248, __this_module={18446744073709551621:18446744073709551620}, calloc(1UL, __size)={18446744073709551616:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, p={18446744073709551616:0}, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5978] RET, EXPR ldv_successful_zalloc(sizeof(struct sk_buff___0 )) VAL [\old(last_index)=0, __this_module={18446744073709551621:18446744073709551620}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_successful_zalloc(sizeof(struct sk_buff___0 ))={18446744073709551616:0}, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5978] tmp___7 = ldv_successful_zalloc(sizeof(struct sk_buff___0 )) [L5979] skb = (struct sk_buff___0 *)tmp___7 VAL [\old(last_index)=0, __this_module={18446744073709551621:18446744073709551620}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, skb={18446744073709551616:0}, tmp___7={18446744073709551616:0}] [L5980] COND FALSE !(! skb) [L5983] CALL ldv_set_add(LDV_SKBS, skb) [L5851] int i ; [L5853] i = 0 VAL [\old(last_index)=0, __this_module={18446744073709551621:18446744073709551620}, e={18446744073709551616:0}, e={18446744073709551616:0}, i=0, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={8:0}] [L5854] COND TRUE 1 VAL [\old(last_index)=0, __this_module={18446744073709551621:18446744073709551620}, e={18446744073709551616:0}, e={18446744073709551616:0}, i=0, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={8:0}] [L5855] COND FALSE !(i < last_index) VAL [\old(last_index)=0, __this_module={18446744073709551621:18446744073709551620}, e={18446744073709551616:0}, e={18446744073709551616:0}, i=0, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={8:0}] [L5865] COND TRUE last_index < 15 [L5866] set_impl[last_index] = e [L5867] last_index = last_index + 1 VAL [\old(last_index)=0, __this_module={18446744073709551621:18446744073709551620}, e={18446744073709551616:0}, e={18446744073709551616:0}, i=0, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={8:0}] [L5983] RET ldv_set_add(LDV_SKBS, skb) [L5984] return (skb); VAL [\old(last_index)=0, \result={18446744073709551616:0}, __this_module={18446744073709551621:18446744073709551620}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, skb={18446744073709551616:0}, tmp___7={18446744073709551616:0}] [L5816] RET, EXPR ldv_skb_alloc() VAL [\old(last_index)=0, \old(length)=1, __this_module={18446744073709551621:18446744073709551620}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_skb_alloc()={18446744073709551616:0}, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, length=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5816] tmp = ldv_skb_alloc() [L5817] return (tmp); VAL [\old(last_index)=0, \old(length)=1, \result={18446744073709551616:0}, __this_module={18446744073709551621:18446744073709551620}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, length=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, tmp={18446744073709551616:0}] [L5412] RET, EXPR ldv_dev_alloc_skb_12(1U) [L5412] skb = ldv_dev_alloc_skb_12(1U) [L5413] COND TRUE (unsigned long )skb == (unsigned long )((struct sk_buff *)0) [L5428] RET x25_connect_disconnect(dev, reason, 1) VAL [\old(last_index)=0, \old(reason)=0, __this_module={18446744073709551621:18446744073709551620}, dev={-3:0}, dev={-3:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, reason=0, ref_cnt=0, set_impl={8:0}] [L5488] RET x25_connected(dev, 0) [L5512] CALL ldv_skb_free(skb) VAL [\old(last_index)=1, __this_module={18446744073709551621:18446744073709551620}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, skb={18446744073709551617:0}] [L5998] CALL ldv_set_remove(LDV_SKBS, skb) VAL [\old(last_index)=1, __this_module={18446744073709551621:18446744073709551620}, e={18446744073709551617:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set_impl={8:0}] [L5876] int i ; [L5877] int deleted_index ; [L5879] deleted_index = -1 [L5880] i = 0 VAL [\old(last_index)=1, __this_module={18446744073709551621:18446744073709551620}, deleted_index=-1, e={18446744073709551617:0}, e={18446744073709551617:0}, i=0, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={8:0}] [L5881] COND TRUE 1 VAL [\old(last_index)=1, __this_module={18446744073709551621:18446744073709551620}, deleted_index=-1, e={18446744073709551617:0}, e={18446744073709551617:0}, i=0, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={8:0}] [L5882] COND TRUE i < last_index VAL [\old(last_index)=1, __this_module={18446744073709551621:18446744073709551620}, deleted_index=-1, e={18446744073709551617:0}, e={18446744073709551617:0}, i=0, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={8:0}] [L5886] EXPR set_impl[i] VAL [\old(last_index)=1, __this_module={18446744073709551621:18446744073709551620}, deleted_index=-1, e={18446744073709551617:0}, e={18446744073709551617:0}, i=0, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={8:0}, set_impl[i]={18446744073709551616:0}] [L5886] COND FALSE !((unsigned long )set_impl[i] == (unsigned long )e) [L5891] i = i + 1 VAL [\old(last_index)=1, __this_module={18446744073709551621:18446744073709551620}, deleted_index=-1, e={18446744073709551617:0}, e={18446744073709551617:0}, i=1, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={8:0}] [L5881] COND TRUE 1 VAL [\old(last_index)=1, __this_module={18446744073709551621:18446744073709551620}, deleted_index=-1, e={18446744073709551617:0}, e={18446744073709551617:0}, i=1, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={8:0}] [L5882] COND FALSE !(i < last_index) VAL [\old(last_index)=1, __this_module={18446744073709551621:18446744073709551620}, deleted_index=-1, e={18446744073709551617:0}, e={18446744073709551617:0}, i=1, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={8:0}] [L5893] COND FALSE !(deleted_index != -1) VAL [\old(last_index)=1, __this_module={18446744073709551621:18446744073709551620}, deleted_index=-1, e={18446744073709551617:0}, e={18446744073709551617:0}, i=1, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={8:0}] [L5998] RET ldv_set_remove(LDV_SKBS, skb) VAL [\old(last_index)=1, __this_module={18446744073709551621:18446744073709551620}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, skb={18446744073709551617:0}, skb={18446744073709551617:0}] [L5512] RET ldv_skb_free(skb) VAL [\old(last_index)=0, __this_module={18446744073709551621:18446744073709551620}, dev={-3:0}, dev={-3:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, result=3, set_impl={8:0}, skb={18446744073709551617:0}, skb={18446744073709551617:0}, skb->data={0:18446744073709551619}skb->data=257] [L5513] return (0); VAL [\old(last_index)=0, \result=0, __this_module={18446744073709551621:18446744073709551620}, dev={-3:0}, dev={-3:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, result=3, set_impl={8:0}, skb={18446744073709551617:0}, skb={18446744073709551617:0}, skb->data=257skb->data={0:18446744073709551619}] [L5672] RET x25_xmit(proto_group0, proto_group1) VAL [__this_module={18446744073709551621:18446744073709551620}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-2:0}, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, tmp={-2:0}, tmp___0=0, tmp___1=0, tmp___2=1, x25_xmit(proto_group0, proto_group1)=0] [L5673] ldv_state_variable_1 = 1 VAL [__this_module={18446744073709551621:18446744073709551620}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-2:0}, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, tmp={-2:0}, tmp___0=0, tmp___1=0, tmp___2=1] [L5676] COND FALSE !(ldv_state_variable_1 == 2) VAL [__this_module={18446744073709551621:18446744073709551620}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-2:0}, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, tmp={-2:0}, tmp___0=0, tmp___1=0, tmp___2=1] [L5664] tmp___0 = __VERIFIER_nondet_int() [L5666] case 0: [L5731] case 1: VAL [__this_module={18446744073709551621:18446744073709551620}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-2:0}, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, tmp={-2:0}, tmp___0=1, tmp___1=0, tmp___2=1] [L5732] COND TRUE ldv_state_variable_0 != 0 [L5733] tmp___2 = __VERIFIER_nondet_int() [L5735] case 0: VAL [__this_module={18446744073709551621:18446744073709551620}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-2:0}, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, tmp={-2:0}, tmp___0=1, tmp___1=0, tmp___2=0] [L5736] COND TRUE ldv_state_variable_0 == 3 && ref_cnt == 0 [L5737] CALL mod_exit() [L5629] FCALL unregister_hdlc_protocol(& proto) [L5737] RET mod_exit() [L5738] ldv_state_variable_0 = 2 VAL [__this_module={18446744073709551621:18446744073709551620}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=2, ldv_state_variable_1=1, ldvarg0={-2:0}, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, tmp={-2:0}, tmp___0=1, tmp___1=0, tmp___2=0] [L5773] CALL ldv_check_final_state() [L6042] int tmp___7 ; [L6044] CALL, EXPR ldv_set_is_empty(LDV_SKBS) [L5933] return (last_index == 0); VAL [\result=0, __this_module={18446744073709551621:18446744073709551620}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=2, ldv_state_variable_1=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={8:0}] [L6044] RET, EXPR ldv_set_is_empty(LDV_SKBS) [L6044] tmp___7 = ldv_set_is_empty(LDV_SKBS) [L6045] COND FALSE !(\read(tmp___7)) VAL [__this_module={18446744073709551621:18446744073709551620}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=2, ldv_state_variable_1=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, tmp___7=0] [L6047] CALL ldv_error() VAL [__this_module={18446744073709551621:18446744073709551620}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=2, ldv_state_variable_1=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5320] reach_error() VAL [__this_module={18446744073709551621:18446744073709551620}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=2, ldv_state_variable_1=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 18 procedures, 238 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.6s, OverallIterations: 9, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6477 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6371 mSDsluCounter, 10355 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7733 mSDsCounter, 2622 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5968 IncrementalHoareTripleChecker+Invalid, 8590 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2622 mSolverCounterUnsat, 2622 mSDtfsCounter, 5968 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 309 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2234occurred in iteration=7, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 8 MinimizatonAttempts, 4068 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 968 NumberOfCodeBlocks, 968 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 806 ConstructedInterpolants, 0 QuantifiedInterpolants, 1754 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 542/542 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-14 17:45:58,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE