./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 6c24879c 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-?-6c24879 [2022-07-12 12:37:34,629 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 12:37:34,630 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 12:37:34,657 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 12:37:34,657 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 12:37:34,658 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 12:37:34,659 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 12:37:34,660 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 12:37:34,661 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 12:37:34,662 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 12:37:34,662 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 12:37:34,666 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 12:37:34,667 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 12:37:34,684 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 12:37:34,684 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 12:37:34,685 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 12:37:34,686 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 12:37:34,686 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 12:37:34,687 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 12:37:34,688 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 12:37:34,689 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 12:37:34,689 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 12:37:34,690 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 12:37:34,691 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 12:37:34,691 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 12:37:34,693 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 12:37:34,693 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 12:37:34,693 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 12:37:34,694 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 12:37:34,694 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 12:37:34,694 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 12:37:34,694 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 12:37:34,695 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 12:37:34,696 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 12:37:34,696 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 12:37:34,697 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 12:37:34,700 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 12:37:34,700 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 12:37:34,701 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 12:37:34,701 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 12:37:34,702 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 12:37:34,703 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 12:37:34,703 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 12:37:34,721 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 12:37:34,722 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 12:37:34,722 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 12:37:34,722 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 12:37:34,723 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 12:37:34,723 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 12:37:34,723 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 12:37:34,723 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 12:37:34,723 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 12:37:34,724 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 12:37:34,724 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 12:37:34,724 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 12:37:34,724 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 12:37:34,724 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 12:37:34,724 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 12:37:34,725 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 12:37:34,725 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 12:37:34,725 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 12:37:34,725 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 12:37:34,725 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 12:37:34,725 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 12:37:34,725 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 12:37:34,726 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 12:37:34,726 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 12:37:34,726 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 12:37:34,726 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 12:37:34,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 12:37:34,726 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 12:37:34,727 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 12:37:34,727 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 12:37:34,727 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 [2022-07-12 12:37:34,912 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 12:37:34,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 12:37:34,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 12:37:34,932 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 12:37:34,933 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 12:37:34,934 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 [2022-07-12 12:37:34,995 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b46e106a1/58fca68d48e645abb0b6c8bc752ff874/FLAGaa8ec029e [2022-07-12 12:37:35,460 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 12:37:35,463 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 [2022-07-12 12:37:35,489 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b46e106a1/58fca68d48e645abb0b6c8bc752ff874/FLAGaa8ec029e [2022-07-12 12:37:35,709 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b46e106a1/58fca68d48e645abb0b6c8bc752ff874 [2022-07-12 12:37:35,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 12:37:35,712 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 12:37:35,714 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 12:37:35,714 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 12:37:35,719 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 12:37:35,720 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 12:37:35" (1/1) ... [2022-07-12 12:37:35,721 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a96f2e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:37:35, skipping insertion in model container [2022-07-12 12:37:35,721 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 12:37:35" (1/1) ... [2022-07-12 12:37:35,726 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 12:37:35,794 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 12:37:36,265 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] [2022-07-12 12:37:36,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 12:37:36,492 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 12:37:36,589 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] [2022-07-12 12:37:36,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 12:37:36,658 INFO L208 MainTranslator]: Completed translation [2022-07-12 12:37:36,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:37:36 WrapperNode [2022-07-12 12:37:36,660 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 12:37:36,661 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 12:37:36,661 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 12:37:36,662 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 12:37:36,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:37:36" (1/1) ... [2022-07-12 12:37:36,697 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:37:36" (1/1) ... [2022-07-12 12:37:36,744 INFO L137 Inliner]: procedures = 110, calls = 180, calls flagged for inlining = 54, calls inlined = 43, statements flattened = 631 [2022-07-12 12:37:36,748 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 12:37:36,749 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 12:37:36,750 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 12:37:36,750 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 12:37:36,756 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:37:36" (1/1) ... [2022-07-12 12:37:36,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:37:36" (1/1) ... [2022-07-12 12:37:36,769 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:37:36" (1/1) ... [2022-07-12 12:37:36,769 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:37:36" (1/1) ... [2022-07-12 12:37:36,821 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:37:36" (1/1) ... [2022-07-12 12:37:36,825 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:37:36" (1/1) ... [2022-07-12 12:37:36,829 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:37:36" (1/1) ... [2022-07-12 12:37:36,834 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 12:37:36,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 12:37:36,835 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 12:37:36,835 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 12:37:36,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:37:36" (1/1) ... [2022-07-12 12:37:36,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 12:37:36,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:37:36,871 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 12:37:36,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 12:37:36,899 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 12:37:36,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 12:37:36,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 12:37:36,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-12 12:37:36,900 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-12 12:37:36,900 INFO L130 BoogieDeclarations]: Found specification of procedure dev_to_hdlc [2022-07-12 12:37:36,900 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_to_hdlc [2022-07-12 12:37:36,900 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2022-07-12 12:37:36,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2022-07-12 12:37:36,900 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 12:37:36,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 12:37:36,901 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-07-12 12:37:36,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-07-12 12:37:36,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 12:37:36,901 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-12 12:37:36,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-12 12:37:36,901 INFO L130 BoogieDeclarations]: Found specification of procedure x25_ioctl [2022-07-12 12:37:36,901 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_ioctl [2022-07-12 12:37:36,902 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2022-07-12 12:37:36,902 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2022-07-12 12:37:36,902 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 12:37:36,902 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 12:37:36,902 INFO L130 BoogieDeclarations]: Found specification of procedure x25_connect_disconnect [2022-07-12 12:37:36,902 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_connect_disconnect [2022-07-12 12:37:36,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 12:37:36,902 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free_int [2022-07-12 12:37:36,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free_int [2022-07-12 12:37:36,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 12:37:36,903 INFO L130 BoogieDeclarations]: Found specification of procedure x25_type_trans [2022-07-12 12:37:36,903 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_type_trans [2022-07-12 12:37:36,903 INFO L130 BoogieDeclarations]: Found specification of procedure x25_xmit [2022-07-12 12:37:36,903 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_xmit [2022-07-12 12:37:36,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 12:37:36,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 12:37:36,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 12:37:36,903 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-07-12 12:37:36,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-07-12 12:37:36,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 12:37:36,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 12:37:36,904 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_zalloc [2022-07-12 12:37:36,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_zalloc [2022-07-12 12:37:36,904 INFO L130 BoogieDeclarations]: Found specification of procedure x25_rx [2022-07-12 12:37:36,904 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_rx [2022-07-12 12:37:36,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 12:37:36,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 12:37:36,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 12:37:37,106 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 12:37:37,111 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 12:37:37,305 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 12:37:37,515 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 12:37:37,524 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 12:37:37,525 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-12 12:37:37,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:37:37 BoogieIcfgContainer [2022-07-12 12:37:37,527 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 12:37:37,529 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 12:37:37,529 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 12:37:37,531 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 12:37:37,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 12:37:35" (1/3) ... [2022-07-12 12:37:37,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b79b181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 12:37:37, skipping insertion in model container [2022-07-12 12:37:37,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:37:36" (2/3) ... [2022-07-12 12:37:37,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b79b181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 12:37:37, skipping insertion in model container [2022-07-12 12:37:37,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:37:37" (3/3) ... [2022-07-12 12:37:37,535 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 [2022-07-12 12:37:37,544 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 12:37:37,545 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 12:37:37,597 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 12:37:37,601 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@310985d6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4fe4a80e [2022-07-12 12:37:37,602 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 12:37:37,612 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) [2022-07-12 12:37:37,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-12 12:37:37,622 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:37:37,622 INFO L195 NwaCegarLoop]: 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] [2022-07-12 12:37:37,623 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:37:37,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:37:37,628 INFO L85 PathProgramCache]: Analyzing trace with hash 898254007, now seen corresponding path program 1 times [2022-07-12 12:37:37,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:37:37,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945882210] [2022-07-12 12:37:37,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:37:37,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:37:37,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:37,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:37:37,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:37,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:37,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:37,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:37:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:37,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 12:37:37,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:37:37,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945882210] [2022-07-12 12:37:37,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945882210] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:37:37,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:37:37,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:37:37,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6655984] [2022-07-12 12:37:37,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:37:37,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:37:37,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:37:37,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:37:37,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:37:37,928 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) [2022-07-12 12:37:38,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:37:38,545 INFO L93 Difference]: Finished difference Result 786 states and 1141 transitions. [2022-07-12 12:37:38,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:37:38,547 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 [2022-07-12 12:37:38,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:37:38,566 INFO L225 Difference]: With dead ends: 786 [2022-07-12 12:37:38,566 INFO L226 Difference]: Without dead ends: 540 [2022-07-12 12:37:38,582 INFO L412 NwaCegarLoop]: 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 [2022-07-12 12:37:38,589 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 752 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 12:37:38,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 696 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 12:37:38,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2022-07-12 12:37:38,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 432. [2022-07-12 12:37:38,665 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) [2022-07-12 12:37:38,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 572 transitions. [2022-07-12 12:37:38,669 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 572 transitions. Word has length 33 [2022-07-12 12:37:38,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:37:38,670 INFO L495 AbstractCegarLoop]: Abstraction has 432 states and 572 transitions. [2022-07-12 12:37:38,670 INFO L496 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) [2022-07-12 12:37:38,670 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 572 transitions. [2022-07-12 12:37:38,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 12:37:38,672 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:37:38,672 INFO L195 NwaCegarLoop]: 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] [2022-07-12 12:37:38,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 12:37:38,672 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:37:38,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:37:38,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1941540429, now seen corresponding path program 1 times [2022-07-12 12:37:38,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:37:38,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179248128] [2022-07-12 12:37:38,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:37:38,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:37:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:38,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:37:38,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:38,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:38,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:37:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:38,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 12:37:38,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:37:38,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179248128] [2022-07-12 12:37:38,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179248128] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:37:38,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:37:38,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 12:37:38,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220091689] [2022-07-12 12:37:38,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:37:38,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 12:37:38,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:37:38,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 12:37:38,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 12:37:38,797 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) [2022-07-12 12:37:39,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:37:39,125 INFO L93 Difference]: Finished difference Result 965 states and 1293 transitions. [2022-07-12 12:37:39,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 12:37:39,126 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 [2022-07-12 12:37:39,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:37:39,129 INFO L225 Difference]: With dead ends: 965 [2022-07-12 12:37:39,129 INFO L226 Difference]: Without dead ends: 539 [2022-07-12 12:37:39,130 INFO L412 NwaCegarLoop]: 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 [2022-07-12 12:37:39,131 INFO L413 NwaCegarLoop]: 332 mSDtfsCounter, 613 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 12:37:39,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 743 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 12:37:39,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2022-07-12 12:37:39,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 431. [2022-07-12 12:37:39,151 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) [2022-07-12 12:37:39,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 568 transitions. [2022-07-12 12:37:39,153 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 568 transitions. Word has length 36 [2022-07-12 12:37:39,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:37:39,154 INFO L495 AbstractCegarLoop]: Abstraction has 431 states and 568 transitions. [2022-07-12 12:37:39,154 INFO L496 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) [2022-07-12 12:37:39,154 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 568 transitions. [2022-07-12 12:37:39,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-12 12:37:39,157 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:37:39,157 INFO L195 NwaCegarLoop]: 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] [2022-07-12 12:37:39,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 12:37:39,157 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:37:39,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:37:39,158 INFO L85 PathProgramCache]: Analyzing trace with hash 2029658452, now seen corresponding path program 1 times [2022-07-12 12:37:39,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:37:39,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305617129] [2022-07-12 12:37:39,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:37:39,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:37:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:39,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:37:39,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:39,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:39,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:39,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:37:39,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:39,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 12:37:39,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:39,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:39,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:37:39,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:39,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 12:37:39,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:39,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:39,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:39,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:37:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:39,305 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-12 12:37:39,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:37:39,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305617129] [2022-07-12 12:37:39,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305617129] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:37:39,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:37:39,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 12:37:39,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878080291] [2022-07-12 12:37:39,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:37:39,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 12:37:39,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:37:39,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 12:37:39,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 12:37:39,308 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) [2022-07-12 12:37:39,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:37:39,870 INFO L93 Difference]: Finished difference Result 1462 states and 2036 transitions. [2022-07-12 12:37:39,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 12:37:39,871 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 [2022-07-12 12:37:39,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:37:39,877 INFO L225 Difference]: With dead ends: 1462 [2022-07-12 12:37:39,878 INFO L226 Difference]: Without dead ends: 1032 [2022-07-12 12:37:39,880 INFO L412 NwaCegarLoop]: 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 [2022-07-12 12:37:39,884 INFO L413 NwaCegarLoop]: 302 mSDtfsCounter, 504 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 12:37:39,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 1309 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 12:37:39,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2022-07-12 12:37:39,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 840. [2022-07-12 12:37:39,941 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) [2022-07-12 12:37:39,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1137 transitions. [2022-07-12 12:37:39,947 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1137 transitions. Word has length 77 [2022-07-12 12:37:39,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:37:39,949 INFO L495 AbstractCegarLoop]: Abstraction has 840 states and 1137 transitions. [2022-07-12 12:37:39,950 INFO L496 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) [2022-07-12 12:37:39,950 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1137 transitions. [2022-07-12 12:37:39,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-12 12:37:39,959 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:37:39,959 INFO L195 NwaCegarLoop]: 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] [2022-07-12 12:37:39,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 12:37:39,961 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:37:39,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:37:39,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1596249494, now seen corresponding path program 1 times [2022-07-12 12:37:39,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:37:39,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76431406] [2022-07-12 12:37:39,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:37:39,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:37:40,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:40,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:37:40,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:40,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:40,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:40,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:37:40,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:40,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 12:37:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:40,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:40,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:40,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:37:40,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:40,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 12:37:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:40,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:40,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:37:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:40,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 12:37:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:40,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:40,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:40,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:37:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:40,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 12:37:40,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:40,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:40,130 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-07-12 12:37:40,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:37:40,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76431406] [2022-07-12 12:37:40,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76431406] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:37:40,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:37:40,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 12:37:40,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714459550] [2022-07-12 12:37:40,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:37:40,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 12:37:40,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:37:40,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 12:37:40,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-12 12:37:40,133 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) [2022-07-12 12:37:40,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:37:40,818 INFO L93 Difference]: Finished difference Result 2912 states and 3997 transitions. [2022-07-12 12:37:40,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 12:37:40,818 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 [2022-07-12 12:37:40,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:37:40,827 INFO L225 Difference]: With dead ends: 2912 [2022-07-12 12:37:40,836 INFO L226 Difference]: Without dead ends: 2078 [2022-07-12 12:37:40,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-07-12 12:37:40,841 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 577 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 12:37:40,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 1153 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 12:37:40,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2078 states. [2022-07-12 12:37:40,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2078 to 1662. [2022-07-12 12:37:40,899 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) [2022-07-12 12:37:40,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 2208 transitions. [2022-07-12 12:37:40,906 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 2208 transitions. Word has length 119 [2022-07-12 12:37:40,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:37:40,906 INFO L495 AbstractCegarLoop]: Abstraction has 1662 states and 2208 transitions. [2022-07-12 12:37:40,927 INFO L496 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) [2022-07-12 12:37:40,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2208 transitions. [2022-07-12 12:37:40,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-12 12:37:40,934 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:37:40,934 INFO L195 NwaCegarLoop]: 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] [2022-07-12 12:37:40,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 12:37:40,935 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:37:40,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:37:40,936 INFO L85 PathProgramCache]: Analyzing trace with hash 162596766, now seen corresponding path program 1 times [2022-07-12 12:37:40,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:37:40,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199728705] [2022-07-12 12:37:40,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:37:40,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:37:40,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:40,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:37:40,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:41,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:41,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:41,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:37:41,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:41,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 12:37:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:41,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:41,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:37:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:41,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 12:37:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:41,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:41,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:41,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:37:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:41,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 12:37:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:41,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:41,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:37:41,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:41,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 12:37:41,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:41,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:41,110 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-12 12:37:41,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:37:41,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199728705] [2022-07-12 12:37:41,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199728705] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:37:41,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:37:41,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 12:37:41,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678730288] [2022-07-12 12:37:41,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:37:41,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 12:37:41,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:37:41,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 12:37:41,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-12 12:37:41,112 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) [2022-07-12 12:37:41,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:37:41,505 INFO L93 Difference]: Finished difference Result 2954 states and 4105 transitions. [2022-07-12 12:37:41,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:37:41,506 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 [2022-07-12 12:37:41,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:37:41,514 INFO L225 Difference]: With dead ends: 2954 [2022-07-12 12:37:41,514 INFO L226 Difference]: Without dead ends: 2070 [2022-07-12 12:37:41,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:37:41,518 INFO L413 NwaCegarLoop]: 268 mSDtfsCounter, 163 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 12:37:41,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 1014 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 12:37:41,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2070 states. [2022-07-12 12:37:41,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2070 to 1670. [2022-07-12 12:37:41,585 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) [2022-07-12 12:37:41,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 2216 transitions. [2022-07-12 12:37:41,591 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 2216 transitions. Word has length 119 [2022-07-12 12:37:41,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:37:41,591 INFO L495 AbstractCegarLoop]: Abstraction has 1670 states and 2216 transitions. [2022-07-12 12:37:41,592 INFO L496 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) [2022-07-12 12:37:41,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 2216 transitions. [2022-07-12 12:37:41,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-12 12:37:41,595 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:37:41,595 INFO L195 NwaCegarLoop]: 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] [2022-07-12 12:37:41,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 12:37:41,596 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:37:41,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:37:41,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1319541292, now seen corresponding path program 1 times [2022-07-12 12:37:41,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:37:41,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555234773] [2022-07-12 12:37:41,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:37:41,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:37:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:41,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:37:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:41,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:41,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:41,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:37:41,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:41,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 12:37:41,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:41,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:41,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:41,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:37:41,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:41,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 12:37:41,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:41,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:41,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:41,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:37:41,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:41,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 12:37:41,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:41,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:41,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:41,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:37:41,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:41,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:37:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:41,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 12:37:41,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:41,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:41,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:41,827 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-12 12:37:41,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:37:41,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555234773] [2022-07-12 12:37:41,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555234773] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:37:41,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:37:41,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-12 12:37:41,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395270436] [2022-07-12 12:37:41,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:37:41,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 12:37:41,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:37:41,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 12:37:41,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-07-12 12:37:41,830 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) [2022-07-12 12:37:43,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:37:43,087 INFO L93 Difference]: Finished difference Result 4250 states and 5733 transitions. [2022-07-12 12:37:43,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-12 12:37:43,088 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 [2022-07-12 12:37:43,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:37:43,100 INFO L225 Difference]: With dead ends: 4250 [2022-07-12 12:37:43,101 INFO L226 Difference]: Without dead ends: 2586 [2022-07-12 12:37:43,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2022-07-12 12:37:43,107 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 1397 mSDsluCounter, 1339 mSDsCounter, 0 mSdLazyCounter, 1469 mSolverCounterSat, 621 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1413 SdHoareTripleChecker+Valid, 1651 SdHoareTripleChecker+Invalid, 2090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 621 IncrementalHoareTripleChecker+Valid, 1469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-12 12:37:43,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1413 Valid, 1651 Invalid, 2090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [621 Valid, 1469 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-12 12:37:43,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2586 states. [2022-07-12 12:37:43,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2586 to 1698. [2022-07-12 12:37:43,180 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) [2022-07-12 12:37:43,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1698 states and 2192 transitions. [2022-07-12 12:37:43,186 INFO L78 Accepts]: Start accepts. Automaton has 1698 states and 2192 transitions. Word has length 127 [2022-07-12 12:37:43,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:37:43,188 INFO L495 AbstractCegarLoop]: Abstraction has 1698 states and 2192 transitions. [2022-07-12 12:37:43,188 INFO L496 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) [2022-07-12 12:37:43,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1698 states and 2192 transitions. [2022-07-12 12:37:43,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-07-12 12:37:43,191 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:37:43,191 INFO L195 NwaCegarLoop]: 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] [2022-07-12 12:37:43,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 12:37:43,192 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:37:43,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:37:43,192 INFO L85 PathProgramCache]: Analyzing trace with hash -192064408, now seen corresponding path program 1 times [2022-07-12 12:37:43,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:37:43,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100556472] [2022-07-12 12:37:43,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:37:43,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:37:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:43,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:37:43,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:43,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:43,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:43,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:37:43,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:43,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 12:37:43,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:43,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:43,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:43,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:37:43,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:43,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 12:37:43,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:43,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:43,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:43,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:37:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:43,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 12:37:43,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:43,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:43,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:43,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:37:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:43,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:37:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:43,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:43,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:43,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:43,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:37:43,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:43,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 12:37:43,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:43,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:43,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:43,498 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-07-12 12:37:43,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:37:43,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100556472] [2022-07-12 12:37:43,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100556472] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:37:43,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:37:43,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-12 12:37:43,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839906761] [2022-07-12 12:37:43,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:37:43,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 12:37:43,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:37:43,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 12:37:43,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-07-12 12:37:43,501 INFO L87 Difference]: Start difference. First operand 1698 states and 2192 transitions. Second operand has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 9 states have internal predecessors, (77), 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) [2022-07-12 12:37:45,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:37:45,601 INFO L93 Difference]: Finished difference Result 4534 states and 6177 transitions. [2022-07-12 12:37:45,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-12 12:37:45,602 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 9 states have internal predecessors, (77), 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 150 [2022-07-12 12:37:45,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:37:45,618 INFO L225 Difference]: With dead ends: 4534 [2022-07-12 12:37:45,618 INFO L226 Difference]: Without dead ends: 3606 [2022-07-12 12:37:45,621 INFO L412 NwaCegarLoop]: 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 [2022-07-12 12:37:45,622 INFO L413 NwaCegarLoop]: 516 mSDtfsCounter, 1604 mSDsluCounter, 2678 mSDsCounter, 0 mSdLazyCounter, 2529 mSolverCounterSat, 798 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1642 SdHoareTripleChecker+Valid, 3194 SdHoareTripleChecker+Invalid, 3327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 798 IncrementalHoareTripleChecker+Valid, 2529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-12 12:37:45,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1642 Valid, 3194 Invalid, 3327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [798 Valid, 2529 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-12 12:37:45,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3606 states. [2022-07-12 12:37:45,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3606 to 2234. [2022-07-12 12:37:45,744 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) [2022-07-12 12:37:45,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 2872 transitions. [2022-07-12 12:37:45,750 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 2872 transitions. Word has length 150 [2022-07-12 12:37:45,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:37:45,750 INFO L495 AbstractCegarLoop]: Abstraction has 2234 states and 2872 transitions. [2022-07-12 12:37:45,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 9 states have internal predecessors, (77), 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) [2022-07-12 12:37:45,751 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 2872 transitions. [2022-07-12 12:37:45,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-12 12:37:45,754 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:37:45,754 INFO L195 NwaCegarLoop]: 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, 1] [2022-07-12 12:37:45,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 12:37:45,755 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:37:45,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:37:45,755 INFO L85 PathProgramCache]: Analyzing trace with hash -405882487, now seen corresponding path program 1 times [2022-07-12 12:37:45,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:37:45,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193657888] [2022-07-12 12:37:45,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:37:45,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:37:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:45,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:37:45,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:45,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:45,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:45,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:37:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:45,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 12:37:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:45,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:45,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:37:45,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:45,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 12:37:45,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:45,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:45,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:37:45,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:45,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 12:37:45,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:45,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:45,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:45,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:37:45,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:45,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 12:37:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:45,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:45,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:45,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:45,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:45,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:45,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:37:45,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:45,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 12:37:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:45,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:45,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:45,921 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-07-12 12:37:45,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:37:45,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193657888] [2022-07-12 12:37:45,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193657888] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:37:45,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:37:45,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 12:37:45,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855778815] [2022-07-12 12:37:45,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:37:45,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 12:37:45,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:37:45,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 12:37:45,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:37:45,923 INFO L87 Difference]: Start difference. First operand 2234 states and 2872 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 4 states have internal predecessors, (80), 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) [2022-07-12 12:37:46,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:37:46,372 INFO L93 Difference]: Finished difference Result 4214 states and 5577 transitions. [2022-07-12 12:37:46,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 12:37:46,372 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 4 states have internal predecessors, (80), 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 153 [2022-07-12 12:37:46,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:37:46,382 INFO L225 Difference]: With dead ends: 4214 [2022-07-12 12:37:46,383 INFO L226 Difference]: Without dead ends: 2818 [2022-07-12 12:37:46,387 INFO L412 NwaCegarLoop]: 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 [2022-07-12 12:37:46,387 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 282 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 12:37:46,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 1078 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 12:37:46,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states. [2022-07-12 12:37:46,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2234. [2022-07-12 12:37:46,471 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) [2022-07-12 12:37:46,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 2856 transitions. [2022-07-12 12:37:46,476 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 2856 transitions. Word has length 153 [2022-07-12 12:37:46,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:37:46,476 INFO L495 AbstractCegarLoop]: Abstraction has 2234 states and 2856 transitions. [2022-07-12 12:37:46,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 4 states have internal predecessors, (80), 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) [2022-07-12 12:37:46,476 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 2856 transitions. [2022-07-12 12:37:46,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-07-12 12:37:46,480 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:37:46,480 INFO L195 NwaCegarLoop]: 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] [2022-07-12 12:37:46,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 12:37:46,481 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:37:46,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:37:46,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1648213824, now seen corresponding path program 1 times [2022-07-12 12:37:46,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:37:46,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860811040] [2022-07-12 12:37:46,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:37:46,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:37:46,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 12:37:46,538 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 12:37:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 12:37:46,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 12:37:46,624 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 12:37:46,624 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 12:37:46,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 12:37:46,628 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:37:46,630 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 12:37:46,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 12:37:46 BoogieIcfgContainer [2022-07-12 12:37:46,706 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 12:37:46,706 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 12:37:46,706 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 12:37:46,706 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 12:37:46,707 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:37:37" (3/4) ... [2022-07-12 12:37:46,708 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-12 12:37:46,764 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 12:37:46,764 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 12:37:46,764 INFO L158 Benchmark]: Toolchain (without parser) took 11052.36ms. Allocated memory was 104.9MB in the beginning and 331.4MB in the end (delta: 226.5MB). Free memory was 60.9MB in the beginning and 83.7MB in the end (delta: -22.7MB). Peak memory consumption was 203.6MB. Max. memory is 16.1GB. [2022-07-12 12:37:46,764 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 84.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 12:37:46,765 INFO L158 Benchmark]: CACSL2BoogieTranslator took 946.20ms. Allocated memory was 104.9MB in the beginning and 136.3MB in the end (delta: 31.5MB). Free memory was 60.7MB in the beginning and 61.3MB in the end (delta: -544.5kB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. [2022-07-12 12:37:46,765 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.35ms. Allocated memory is still 136.3MB. Free memory was 61.3MB in the beginning and 56.3MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-12 12:37:46,765 INFO L158 Benchmark]: Boogie Preprocessor took 84.88ms. Allocated memory is still 136.3MB. Free memory was 56.3MB in the beginning and 89.5MB in the end (delta: -33.2MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2022-07-12 12:37:46,765 INFO L158 Benchmark]: RCFGBuilder took 692.29ms. Allocated memory is still 136.3MB. Free memory was 89.5MB in the beginning and 78.6MB in the end (delta: 10.9MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. [2022-07-12 12:37:46,766 INFO L158 Benchmark]: TraceAbstraction took 9176.82ms. Allocated memory was 136.3MB in the beginning and 331.4MB in the end (delta: 195.0MB). Free memory was 77.9MB in the beginning and 103.6MB in the end (delta: -25.6MB). Peak memory consumption was 169.6MB. Max. memory is 16.1GB. [2022-07-12 12:37:46,766 INFO L158 Benchmark]: Witness Printer took 57.89ms. Allocated memory is still 331.4MB. Free memory was 103.6MB in the beginning and 83.7MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-07-12 12:37:46,784 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 104.9MB. Free memory is still 84.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 946.20ms. Allocated memory was 104.9MB in the beginning and 136.3MB in the end (delta: 31.5MB). Free memory was 60.7MB in the beginning and 61.3MB in the end (delta: -544.5kB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.35ms. Allocated memory is still 136.3MB. Free memory was 61.3MB in the beginning and 56.3MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.88ms. Allocated memory is still 136.3MB. Free memory was 56.3MB in the beginning and 89.5MB in the end (delta: -33.2MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. * RCFGBuilder took 692.29ms. Allocated memory is still 136.3MB. Free memory was 89.5MB in the beginning and 78.6MB in the end (delta: 10.9MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. * TraceAbstraction took 9176.82ms. Allocated memory was 136.3MB in the beginning and 331.4MB in the end (delta: 195.0MB). Free memory was 77.9MB in the beginning and 103.6MB in the end (delta: -25.6MB). Peak memory consumption was 169.6MB. Max. memory is 16.1GB. * Witness Printer took 57.89ms. Allocated memory is still 331.4MB. Free memory was 103.6MB in the beginning and 83.7MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. 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={0:0}, set={8: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: 9.1s, OverallIterations: 9, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5998 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5892 mSDsluCounter, 10838 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8220 mSDsCounter, 2387 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6392 IncrementalHoareTripleChecker+Invalid, 8779 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2387 mSolverCounterUnsat, 2618 mSDtfsCounter, 6392 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 309 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 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.2s 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! [2022-07-12 12:37:46,812 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