./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 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9566dab1-d464-477b-8ff0-a7562f42f5bf/bin/utaipan-6cKwYrpEi9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9566dab1-d464-477b-8ff0-a7562f42f5bf/bin/utaipan-6cKwYrpEi9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9566dab1-d464-477b-8ff0-a7562f42f5bf/bin/utaipan-6cKwYrpEi9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9566dab1-d464-477b-8ff0-a7562f42f5bf/bin/utaipan-6cKwYrpEi9/config/TaipanReach.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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9566dab1-d464-477b-8ff0-a7562f42f5bf/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9566dab1-d464-477b-8ff0-a7562f42f5bf/bin/utaipan-6cKwYrpEi9 --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 Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 9ca2eb28b930065096f039703bc8c545a25de7919cc90a3441476b4fab43b08c --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 19:49:52,597 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 19:49:52,600 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 19:49:52,633 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 19:49:52,634 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 19:49:52,635 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 19:49:52,636 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 19:49:52,638 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 19:49:52,640 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 19:49:52,641 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 19:49:52,642 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 19:49:52,643 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 19:49:52,644 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 19:49:52,649 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 19:49:52,650 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 19:49:52,652 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 19:49:52,653 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 19:49:52,654 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 19:49:52,656 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 19:49:52,658 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 19:49:52,660 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 19:49:52,668 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 19:49:52,669 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 19:49:52,671 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 19:49:52,675 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 19:49:52,675 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 19:49:52,676 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 19:49:52,677 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 19:49:52,677 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 19:49:52,691 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 19:49:52,692 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 19:49:52,693 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 19:49:52,695 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 19:49:52,696 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 19:49:52,697 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 19:49:52,697 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 19:49:52,698 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 19:49:52,698 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 19:49:52,699 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 19:49:52,700 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 19:49:52,700 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 19:49:52,701 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9566dab1-d464-477b-8ff0-a7562f42f5bf/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-64bit-Taipan_Default.epf [2022-11-20 19:49:52,728 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 19:49:52,729 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 19:49:52,729 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 19:49:52,729 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 19:49:52,730 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 19:49:52,730 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 19:49:52,731 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-20 19:49:52,731 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-20 19:49:52,731 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-20 19:49:52,732 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-20 19:49:52,732 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-20 19:49:52,732 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-20 19:49:52,732 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-20 19:49:52,733 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-20 19:49:52,733 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-20 19:49:52,733 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-20 19:49:52,733 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-20 19:49:52,734 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-20 19:49:52,734 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 19:49:52,735 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 19:49:52,735 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 19:49:52,735 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 19:49:52,736 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 19:49:52,737 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 19:49:52,737 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 19:49:52,737 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 19:49:52,737 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 19:49:52,738 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 19:49:52,738 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 19:49:52,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 19:49:52,739 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 19:49:52,739 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-20 19:49:52,739 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 19:49:52,739 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 19:49:52,740 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-20 19:49:52,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 19:49:52,740 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 19:49:52,740 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-20 19:49:52,741 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9566dab1-d464-477b-8ff0-a7562f42f5bf/bin/utaipan-6cKwYrpEi9/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9566dab1-d464-477b-8ff0-a7562f42f5bf/bin/utaipan-6cKwYrpEi9 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 -> Taipan 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-11-20 19:49:53,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 19:49:53,098 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 19:49:53,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 19:49:53,102 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 19:49:53,103 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 19:49:53,104 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9566dab1-d464-477b-8ff0-a7562f42f5bf/bin/utaipan-6cKwYrpEi9/../../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-11-20 19:49:56,241 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 19:49:56,735 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 19:49:56,735 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9566dab1-d464-477b-8ff0-a7562f42f5bf/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-11-20 19:49:56,775 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9566dab1-d464-477b-8ff0-a7562f42f5bf/bin/utaipan-6cKwYrpEi9/data/492639762/5ba5eac3f5e84f9e93d7405d645c47d6/FLAGb5ff803d2 [2022-11-20 19:49:56,794 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9566dab1-d464-477b-8ff0-a7562f42f5bf/bin/utaipan-6cKwYrpEi9/data/492639762/5ba5eac3f5e84f9e93d7405d645c47d6 [2022-11-20 19:49:56,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 19:49:56,799 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 19:49:56,800 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 19:49:56,800 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 19:49:56,804 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 19:49:56,805 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:49:56" (1/1) ... [2022-11-20 19:49:56,806 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5296ce2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:56, skipping insertion in model container [2022-11-20 19:49:56,806 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:49:56" (1/1) ... [2022-11-20 19:49:56,815 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 19:49:56,929 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 19:49:57,859 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9566dab1-d464-477b-8ff0-a7562f42f5bf/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-11-20 19:49:58,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 19:49:58,154 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 19:49:58,271 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9566dab1-d464-477b-8ff0-a7562f42f5bf/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-11-20 19:49:58,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 19:49:58,350 INFO L208 MainTranslator]: Completed translation [2022-11-20 19:49:58,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:58 WrapperNode [2022-11-20 19:49:58,350 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 19:49:58,352 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 19:49:58,352 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 19:49:58,352 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 19:49:58,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:58" (1/1) ... [2022-11-20 19:49:58,386 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:58" (1/1) ... [2022-11-20 19:49:58,425 INFO L138 Inliner]: procedures = 110, calls = 180, calls flagged for inlining = 54, calls inlined = 43, statements flattened = 631 [2022-11-20 19:49:58,425 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 19:49:58,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 19:49:58,426 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 19:49:58,426 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 19:49:58,436 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:58" (1/1) ... [2022-11-20 19:49:58,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:58" (1/1) ... [2022-11-20 19:49:58,445 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:58" (1/1) ... [2022-11-20 19:49:58,446 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:58" (1/1) ... [2022-11-20 19:49:58,467 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:58" (1/1) ... [2022-11-20 19:49:58,472 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:58" (1/1) ... [2022-11-20 19:49:58,477 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:58" (1/1) ... [2022-11-20 19:49:58,481 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:58" (1/1) ... [2022-11-20 19:49:58,488 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 19:49:58,489 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 19:49:58,489 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 19:49:58,489 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 19:49:58,490 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:58" (1/1) ... [2022-11-20 19:49:58,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 19:49:58,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9566dab1-d464-477b-8ff0-a7562f42f5bf/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:49:58,532 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9566dab1-d464-477b-8ff0-a7562f42f5bf/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 19:49:58,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9566dab1-d464-477b-8ff0-a7562f42f5bf/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 19:49:58,589 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-20 19:49:58,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-20 19:49:58,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 19:49:58,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-20 19:49:58,590 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-20 19:49:58,590 INFO L130 BoogieDeclarations]: Found specification of procedure dev_to_hdlc [2022-11-20 19:49:58,590 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_to_hdlc [2022-11-20 19:49:58,590 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2022-11-20 19:49:58,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2022-11-20 19:49:58,591 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-20 19:49:58,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-20 19:49:58,591 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-11-20 19:49:58,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-11-20 19:49:58,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 19:49:58,591 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-20 19:49:58,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-20 19:49:58,591 INFO L130 BoogieDeclarations]: Found specification of procedure x25_ioctl [2022-11-20 19:49:58,592 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_ioctl [2022-11-20 19:49:58,592 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2022-11-20 19:49:58,592 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2022-11-20 19:49:58,592 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-20 19:49:58,592 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-20 19:49:58,592 INFO L130 BoogieDeclarations]: Found specification of procedure x25_connect_disconnect [2022-11-20 19:49:58,593 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_connect_disconnect [2022-11-20 19:49:58,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 19:49:58,593 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free_int [2022-11-20 19:49:58,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free_int [2022-11-20 19:49:58,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 19:49:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure x25_type_trans [2022-11-20 19:49:58,595 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_type_trans [2022-11-20 19:49:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure x25_xmit [2022-11-20 19:49:58,595 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_xmit [2022-11-20 19:49:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 19:49:58,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 19:49:58,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 19:49:58,596 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-11-20 19:49:58,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-11-20 19:49:58,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 19:49:58,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-20 19:49:58,597 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_zalloc [2022-11-20 19:49:58,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_zalloc [2022-11-20 19:49:58,597 INFO L130 BoogieDeclarations]: Found specification of procedure x25_rx [2022-11-20 19:49:58,597 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_rx [2022-11-20 19:49:58,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 19:49:58,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 19:49:58,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 19:49:59,020 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 19:49:59,023 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 19:49:59,401 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-20 19:49:59,754 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 19:50:00,271 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 19:50:00,272 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-20 19:50:00,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:50:00 BoogieIcfgContainer [2022-11-20 19:50:00,276 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 19:50:00,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 19:50:00,279 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 19:50:00,283 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 19:50:00,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:49:56" (1/3) ... [2022-11-20 19:50:00,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56af0994 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:50:00, skipping insertion in model container [2022-11-20 19:50:00,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:58" (2/3) ... [2022-11-20 19:50:00,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56af0994 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:50:00, skipping insertion in model container [2022-11-20 19:50:00,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:50:00" (3/3) ... [2022-11-20 19:50:00,291 INFO L112 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-11-20 19:50:00,313 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 19:50:00,313 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 19:50:00,391 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 19:50:00,397 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=FINITE_AUTOMATA, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@132ddad5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 19:50:00,397 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 19:50:00,401 INFO L276 IsEmpty]: Start isEmpty. Operand has 167 states, 114 states have (on average 1.4298245614035088) internal successors, (163), 120 states have internal predecessors, (163), 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-11-20 19:50:00,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 19:50:00,411 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:50:00,411 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] [2022-11-20 19:50:00,415 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:50:00,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:50:00,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1251365286, now seen corresponding path program 1 times [2022-11-20 19:50:00,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:50:00,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502096260] [2022-11-20 19:50:00,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:50:00,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:50:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:50:00,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:50:00,917 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:50:00,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502096260] [2022-11-20 19:50:00,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502096260] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:50:00,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:50:00,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 19:50:00,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243944916] [2022-11-20 19:50:00,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:50:00,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 19:50:00,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:50:00,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 19:50:00,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 19:50:00,996 INFO L87 Difference]: Start difference. First operand has 167 states, 114 states have (on average 1.4298245614035088) internal successors, (163), 120 states have internal predecessors, (163), 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 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 19:50:01,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:50:01,423 INFO L93 Difference]: Finished difference Result 481 states and 694 transitions. [2022-11-20 19:50:01,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 19:50:01,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (4), 2 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 23 [2022-11-20 19:50:01,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:50:01,443 INFO L225 Difference]: With dead ends: 481 [2022-11-20 19:50:01,446 INFO L226 Difference]: Without dead ends: 307 [2022-11-20 19:50:01,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 19:50:01,463 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 199 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 19:50:01,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 407 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 19:50:01,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-11-20 19:50:01,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2022-11-20 19:50:01,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 216 states have (on average 1.3611111111111112) internal successors, (294), 218 states have internal predecessors, (294), 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-11-20 19:50:01,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 413 transitions. [2022-11-20 19:50:01,609 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 413 transitions. Word has length 23 [2022-11-20 19:50:01,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:50:01,611 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 413 transitions. [2022-11-20 19:50:01,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 19:50:01,614 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 413 transitions. [2022-11-20 19:50:01,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 19:50:01,618 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:50:01,618 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] [2022-11-20 19:50:01,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 19:50:01,619 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:50:01,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:50:01,621 INFO L85 PathProgramCache]: Analyzing trace with hash 2068103764, now seen corresponding path program 1 times [2022-11-20 19:50:01,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:50:01,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21960592] [2022-11-20 19:50:01,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:50:01,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:50:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:50:01,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:50:01,942 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:50:01,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21960592] [2022-11-20 19:50:01,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21960592] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:50:01,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:50:01,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 19:50:01,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673946329] [2022-11-20 19:50:01,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:50:01,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 19:50:01,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:50:01,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 19:50:01,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 19:50:01,946 INFO L87 Difference]: Start difference. First operand 307 states and 413 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 19:50:02,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:50:02,340 INFO L93 Difference]: Finished difference Result 611 states and 850 transitions. [2022-11-20 19:50:02,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 19:50:02,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 2 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 26 [2022-11-20 19:50:02,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:50:02,359 INFO L225 Difference]: With dead ends: 611 [2022-11-20 19:50:02,359 INFO L226 Difference]: Without dead ends: 606 [2022-11-20 19:50:02,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 19:50:02,361 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 200 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 19:50:02,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 623 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 19:50:02,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2022-11-20 19:50:02,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 598. [2022-11-20 19:50:02,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 419 states have (on average 1.360381861575179) internal successors, (570), 423 states have internal predecessors, (570), 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-11-20 19:50:02,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 833 transitions. [2022-11-20 19:50:02,440 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 833 transitions. Word has length 26 [2022-11-20 19:50:02,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:50:02,441 INFO L495 AbstractCegarLoop]: Abstraction has 598 states and 833 transitions. [2022-11-20 19:50:02,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 19:50:02,441 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 833 transitions. [2022-11-20 19:50:02,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-20 19:50:02,446 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:50:02,446 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 19:50:02,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 19:50:02,447 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:50:02,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:50:02,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1111201139, now seen corresponding path program 1 times [2022-11-20 19:50:02,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:50:02,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494119685] [2022-11-20 19:50:02,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:50:02,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:50:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:50:02,595 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 19:50:02,596 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:50:02,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494119685] [2022-11-20 19:50:02,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494119685] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:50:02,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:50:02,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 19:50:02,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395254388] [2022-11-20 19:50:02,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:50:02,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 19:50:02,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:50:02,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 19:50:02,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 19:50:02,600 INFO L87 Difference]: Start difference. First operand 598 states and 833 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-20 19:50:02,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:50:02,854 INFO L93 Difference]: Finished difference Result 1264 states and 1759 transitions. [2022-11-20 19:50:02,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 19:50:02,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 68 [2022-11-20 19:50:02,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:50:02,864 INFO L225 Difference]: With dead ends: 1264 [2022-11-20 19:50:02,864 INFO L226 Difference]: Without dead ends: 669 [2022-11-20 19:50:02,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 19:50:02,874 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 36 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 19:50:02,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 352 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 19:50:02,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2022-11-20 19:50:02,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 664. [2022-11-20 19:50:02,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 480 states have (on average 1.3645833333333333) internal successors, (655), 484 states have internal predecessors, (655), 120 states have call successors, (120), 64 states have call predecessors, (120), 63 states have return successors, (147), 119 states have call predecessors, (147), 119 states have call successors, (147) [2022-11-20 19:50:02,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 922 transitions. [2022-11-20 19:50:02,954 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 922 transitions. Word has length 68 [2022-11-20 19:50:02,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:50:02,954 INFO L495 AbstractCegarLoop]: Abstraction has 664 states and 922 transitions. [2022-11-20 19:50:02,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-20 19:50:02,955 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 922 transitions. [2022-11-20 19:50:02,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-20 19:50:02,962 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:50:02,963 INFO L195 NwaCegarLoop]: trace histogram [5, 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] [2022-11-20 19:50:02,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 19:50:02,968 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:50:02,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:50:02,969 INFO L85 PathProgramCache]: Analyzing trace with hash -732578664, now seen corresponding path program 1 times [2022-11-20 19:50:02,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:50:02,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765936479] [2022-11-20 19:50:02,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:50:02,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:50:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:50:03,171 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-20 19:50:03,171 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:50:03,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765936479] [2022-11-20 19:50:03,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765936479] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:50:03,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:50:03,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 19:50:03,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865827708] [2022-11-20 19:50:03,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:50:03,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 19:50:03,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:50:03,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 19:50:03,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 19:50:03,174 INFO L87 Difference]: Start difference. First operand 664 states and 922 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-20 19:50:03,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:50:03,501 INFO L93 Difference]: Finished difference Result 1852 states and 2565 transitions. [2022-11-20 19:50:03,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 19:50:03,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 98 [2022-11-20 19:50:03,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:50:03,510 INFO L225 Difference]: With dead ends: 1852 [2022-11-20 19:50:03,510 INFO L226 Difference]: Without dead ends: 1201 [2022-11-20 19:50:03,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 19:50:03,514 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 181 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 19:50:03,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 376 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 19:50:03,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2022-11-20 19:50:03,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 1196. [2022-11-20 19:50:03,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 864 states have (on average 1.34375) internal successors, (1161), 872 states have internal predecessors, (1161), 208 states have call successors, (208), 124 states have call predecessors, (208), 123 states have return successors, (255), 207 states have call predecessors, (255), 207 states have call successors, (255) [2022-11-20 19:50:03,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1624 transitions. [2022-11-20 19:50:03,598 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1624 transitions. Word has length 98 [2022-11-20 19:50:03,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:50:03,599 INFO L495 AbstractCegarLoop]: Abstraction has 1196 states and 1624 transitions. [2022-11-20 19:50:03,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-20 19:50:03,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1624 transitions. [2022-11-20 19:50:03,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-20 19:50:03,603 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:50:03,604 INFO L195 NwaCegarLoop]: trace histogram [5, 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] [2022-11-20 19:50:03,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 19:50:03,604 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:50:03,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:50:03,605 INFO L85 PathProgramCache]: Analyzing trace with hash 112575370, now seen corresponding path program 1 times [2022-11-20 19:50:03,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:50:03,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839663309] [2022-11-20 19:50:03,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:50:03,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:50:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:50:03,737 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-20 19:50:03,739 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:50:03,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839663309] [2022-11-20 19:50:03,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839663309] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:50:03,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:50:03,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 19:50:03,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111983535] [2022-11-20 19:50:03,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:50:03,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 19:50:03,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:50:03,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 19:50:03,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 19:50:03,743 INFO L87 Difference]: Start difference. First operand 1196 states and 1624 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-20 19:50:03,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:50:03,963 INFO L93 Difference]: Finished difference Result 1814 states and 2537 transitions. [2022-11-20 19:50:03,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 19:50:03,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2022-11-20 19:50:03,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:50:03,974 INFO L225 Difference]: With dead ends: 1814 [2022-11-20 19:50:03,974 INFO L226 Difference]: Without dead ends: 1212 [2022-11-20 19:50:03,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 19:50:03,979 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 4 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 19:50:03,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 360 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 19:50:03,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2022-11-20 19:50:04,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1212. [2022-11-20 19:50:04,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 876 states have (on average 1.3390410958904109) internal successors, (1173), 888 states have internal predecessors, (1173), 208 states have call successors, (208), 124 states have call predecessors, (208), 127 states have return successors, (263), 207 states have call predecessors, (263), 207 states have call successors, (263) [2022-11-20 19:50:04,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1644 transitions. [2022-11-20 19:50:04,056 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1644 transitions. Word has length 98 [2022-11-20 19:50:04,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:50:04,057 INFO L495 AbstractCegarLoop]: Abstraction has 1212 states and 1644 transitions. [2022-11-20 19:50:04,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-20 19:50:04,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1644 transitions. [2022-11-20 19:50:04,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-20 19:50:04,065 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:50:04,065 INFO L195 NwaCegarLoop]: trace histogram [5, 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] [2022-11-20 19:50:04,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 19:50:04,066 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:50:04,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:50:04,067 INFO L85 PathProgramCache]: Analyzing trace with hash 418382135, now seen corresponding path program 1 times [2022-11-20 19:50:04,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:50:04,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371867263] [2022-11-20 19:50:04,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:50:04,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:50:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:50:04,561 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-20 19:50:04,561 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:50:04,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371867263] [2022-11-20 19:50:04,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371867263] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:50:04,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:50:04,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 19:50:04,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274074009] [2022-11-20 19:50:04,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:50:04,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 19:50:04,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:50:04,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 19:50:04,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-20 19:50:04,564 INFO L87 Difference]: Start difference. First operand 1212 states and 1644 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 4 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-20 19:50:05,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:50:05,952 INFO L93 Difference]: Finished difference Result 2687 states and 3723 transitions. [2022-11-20 19:50:05,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 19:50:05,953 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 4 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) Word has length 99 [2022-11-20 19:50:05,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:50:05,964 INFO L225 Difference]: With dead ends: 2687 [2022-11-20 19:50:05,964 INFO L226 Difference]: Without dead ends: 1488 [2022-11-20 19:50:05,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-11-20 19:50:05,972 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 366 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-20 19:50:05,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 830 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-20 19:50:05,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2022-11-20 19:50:06,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1264. [2022-11-20 19:50:06,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1264 states, 908 states have (on average 1.3182819383259912) internal successors, (1197), 916 states have internal predecessors, (1197), 220 states have call successors, (220), 124 states have call predecessors, (220), 135 states have return successors, (251), 231 states have call predecessors, (251), 219 states have call successors, (251) [2022-11-20 19:50:06,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 1668 transitions. [2022-11-20 19:50:06,072 INFO L78 Accepts]: Start accepts. Automaton has 1264 states and 1668 transitions. Word has length 99 [2022-11-20 19:50:06,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:50:06,073 INFO L495 AbstractCegarLoop]: Abstraction has 1264 states and 1668 transitions. [2022-11-20 19:50:06,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 4 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-20 19:50:06,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 1668 transitions. [2022-11-20 19:50:06,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-20 19:50:06,077 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:50:06,078 INFO L195 NwaCegarLoop]: trace histogram [6, 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] [2022-11-20 19:50:06,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 19:50:06,078 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:50:06,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:50:06,079 INFO L85 PathProgramCache]: Analyzing trace with hash 890081793, now seen corresponding path program 1 times [2022-11-20 19:50:06,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:50:06,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450049059] [2022-11-20 19:50:06,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:50:06,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:50:06,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:50:06,769 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-11-20 19:50:06,769 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:50:06,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450049059] [2022-11-20 19:50:06,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450049059] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:50:06,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:50:06,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 19:50:06,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705086941] [2022-11-20 19:50:06,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:50:06,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 19:50:06,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:50:06,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 19:50:06,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-20 19:50:06,774 INFO L87 Difference]: Start difference. First operand 1264 states and 1668 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 6 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (13), 8 states have call predecessors, (13), 5 states have call successors, (13) [2022-11-20 19:50:08,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:50:08,553 INFO L93 Difference]: Finished difference Result 2658 states and 3737 transitions. [2022-11-20 19:50:08,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 19:50:08,554 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 6 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (13), 8 states have call predecessors, (13), 5 states have call successors, (13) Word has length 119 [2022-11-20 19:50:08,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:50:08,564 INFO L225 Difference]: With dead ends: 2658 [2022-11-20 19:50:08,565 INFO L226 Difference]: Without dead ends: 1984 [2022-11-20 19:50:08,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-11-20 19:50:08,568 INFO L413 NwaCegarLoop]: 323 mSDtfsCounter, 723 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 359 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 359 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-20 19:50:08,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 1097 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [359 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-20 19:50:08,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1984 states. [2022-11-20 19:50:08,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1984 to 1448. [2022-11-20 19:50:08,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1448 states, 1032 states have (on average 1.2877906976744187) internal successors, (1329), 1032 states have internal predecessors, (1329), 240 states have call successors, (240), 140 states have call predecessors, (240), 175 states have return successors, (371), 283 states have call predecessors, (371), 239 states have call successors, (371) [2022-11-20 19:50:08,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1448 states and 1940 transitions. [2022-11-20 19:50:08,710 INFO L78 Accepts]: Start accepts. Automaton has 1448 states and 1940 transitions. Word has length 119 [2022-11-20 19:50:08,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:50:08,711 INFO L495 AbstractCegarLoop]: Abstraction has 1448 states and 1940 transitions. [2022-11-20 19:50:08,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 6 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (13), 8 states have call predecessors, (13), 5 states have call successors, (13) [2022-11-20 19:50:08,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 1940 transitions. [2022-11-20 19:50:08,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-11-20 19:50:08,715 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:50:08,716 INFO L195 NwaCegarLoop]: trace histogram [6, 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] [2022-11-20 19:50:08,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 19:50:08,716 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:50:08,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:50:08,717 INFO L85 PathProgramCache]: Analyzing trace with hash 614243022, now seen corresponding path program 1 times [2022-11-20 19:50:08,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:50:08,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395230933] [2022-11-20 19:50:08,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:50:08,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:50:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:50:08,920 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-11-20 19:50:08,921 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:50:08,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395230933] [2022-11-20 19:50:08,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395230933] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:50:08,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:50:08,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 19:50:08,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810132494] [2022-11-20 19:50:08,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:50:08,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 19:50:08,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:50:08,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 19:50:08,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 19:50:08,924 INFO L87 Difference]: Start difference. First operand 1448 states and 1940 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-11-20 19:50:09,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:50:09,206 INFO L93 Difference]: Finished difference Result 2334 states and 3229 transitions. [2022-11-20 19:50:09,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 19:50:09,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (14), 2 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 120 [2022-11-20 19:50:09,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:50:09,216 INFO L225 Difference]: With dead ends: 2334 [2022-11-20 19:50:09,217 INFO L226 Difference]: Without dead ends: 1476 [2022-11-20 19:50:09,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 19:50:09,222 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 10 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 19:50:09,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 544 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 19:50:09,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2022-11-20 19:50:09,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 1456. [2022-11-20 19:50:09,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1456 states, 1040 states have (on average 1.289423076923077) internal successors, (1341), 1040 states have internal predecessors, (1341), 240 states have call successors, (240), 140 states have call predecessors, (240), 175 states have return successors, (371), 283 states have call predecessors, (371), 239 states have call successors, (371) [2022-11-20 19:50:09,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1456 states and 1952 transitions. [2022-11-20 19:50:09,338 INFO L78 Accepts]: Start accepts. Automaton has 1456 states and 1952 transitions. Word has length 120 [2022-11-20 19:50:09,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:50:09,340 INFO L495 AbstractCegarLoop]: Abstraction has 1456 states and 1952 transitions. [2022-11-20 19:50:09,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-11-20 19:50:09,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 1952 transitions. [2022-11-20 19:50:09,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-11-20 19:50:09,385 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:50:09,386 INFO L195 NwaCegarLoop]: trace histogram [6, 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] [2022-11-20 19:50:09,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 19:50:09,386 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:50:09,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:50:09,386 INFO L85 PathProgramCache]: Analyzing trace with hash -686245590, now seen corresponding path program 1 times [2022-11-20 19:50:09,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:50:09,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206892900] [2022-11-20 19:50:09,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:50:09,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:50:09,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 19:50:09,513 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 19:50:09,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 19:50:09,715 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-20 19:50:09,715 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 19:50:09,717 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-20 19:50:09,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 19:50:09,723 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:50:09,728 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 19:50:09,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:50:09 BoogieIcfgContainer [2022-11-20 19:50:09,888 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 19:50:09,888 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 19:50:09,888 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 19:50:09,889 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 19:50:09,889 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:50:00" (3/4) ... [2022-11-20 19:50:09,892 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 19:50:10,042 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9566dab1-d464-477b-8ff0-a7562f42f5bf/bin/utaipan-6cKwYrpEi9/witness.graphml [2022-11-20 19:50:10,042 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 19:50:10,043 INFO L158 Benchmark]: Toolchain (without parser) took 13244.24ms. Allocated memory was 184.5MB in the beginning and 350.2MB in the end (delta: 165.7MB). Free memory was 131.2MB in the beginning and 219.3MB in the end (delta: -88.1MB). Peak memory consumption was 78.8MB. Max. memory is 16.1GB. [2022-11-20 19:50:10,043 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 138.4MB. Free memory is still 80.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 19:50:10,043 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1550.78ms. Allocated memory is still 184.5MB. Free memory was 131.2MB in the beginning and 99.5MB in the end (delta: 31.7MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. [2022-11-20 19:50:10,044 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.63ms. Allocated memory is still 184.5MB. Free memory was 99.5MB in the beginning and 94.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-20 19:50:10,044 INFO L158 Benchmark]: Boogie Preprocessor took 62.38ms. Allocated memory is still 184.5MB. Free memory was 94.3MB in the beginning and 89.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 19:50:10,045 INFO L158 Benchmark]: RCFGBuilder took 1787.18ms. Allocated memory was 184.5MB in the beginning and 270.5MB in the end (delta: 86.0MB). Free memory was 89.0MB in the beginning and 183.1MB in the end (delta: -94.0MB). Peak memory consumption was 46.5MB. Max. memory is 16.1GB. [2022-11-20 19:50:10,045 INFO L158 Benchmark]: TraceAbstraction took 9608.78ms. Allocated memory was 270.5MB in the beginning and 350.2MB in the end (delta: 79.7MB). Free memory was 182.0MB in the beginning and 237.1MB in the end (delta: -55.1MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2022-11-20 19:50:10,046 INFO L158 Benchmark]: Witness Printer took 153.94ms. Allocated memory is still 350.2MB. Free memory was 237.1MB in the beginning and 219.3MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-20 19:50:10,048 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.33ms. Allocated memory is still 138.4MB. Free memory is still 80.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1550.78ms. Allocated memory is still 184.5MB. Free memory was 131.2MB in the beginning and 99.5MB in the end (delta: 31.7MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.63ms. Allocated memory is still 184.5MB. Free memory was 99.5MB in the beginning and 94.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.38ms. Allocated memory is still 184.5MB. Free memory was 94.3MB in the beginning and 89.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1787.18ms. Allocated memory was 184.5MB in the beginning and 270.5MB in the end (delta: 86.0MB). Free memory was 89.0MB in the beginning and 183.1MB in the end (delta: -94.0MB). Peak memory consumption was 46.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9608.78ms. Allocated memory was 270.5MB in the beginning and 350.2MB in the end (delta: 79.7MB). Free memory was 182.0MB in the beginning and 237.1MB in the end (delta: -55.1MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. * Witness Printer took 153.94ms. Allocated memory is still 350.2MB. Free memory was 237.1MB in the beginning and 219.3MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. 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 ; [L5651] struct ifreq *ldvarg0 ; [L5652] void *tmp ; [L5653] int tmp___0 ; [L5654] int tmp___1 ; [L5655] int tmp___2 ; VAL [__this_module={3266:3265}, 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={3266:3265}, 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={3266:3265}, 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={3266:3265}, 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={3266:3265}, 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) [L5263] RET assume_abort_if_not(p != (void *)0) VAL [\old(__size)=40, __size=40, __this_module={3266:3265}, 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; [L5657] RET, EXPR ldv_successful_zalloc(40UL) VAL [__this_module={3266:3265}, 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 [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={3266:3265}, 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={3266:3265}, 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={3266:3265}, 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); [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={3266:3265}, 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={3266:3265}, 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={3266:3265}, 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={3266:3265}, 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={3266:3265}, 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) [L5263] RET assume_abort_if_not(p != (void *)0) VAL [\old(__size)=3264, __size=3264, __this_module={3266:3265}, 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; [L5642] RET, EXPR ldv_successful_zalloc(3264UL) VAL [__this_module={3266:3265}, 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={3266:3265}, 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={3266:3265}, 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={3266:3265}, calloc(1UL, __size)={-18446744073709551615: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={3266:3265}, calloc(1UL, __size)={-18446744073709551615: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={-18446744073709551615: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={3266:3265}, 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) [L5263] RET assume_abort_if_not(p != (void *)0) VAL [\old(__size)=232, __size=232, __this_module={3266:3265}, calloc(1UL, __size)={-18446744073709551615: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={-18446744073709551615:0}, proto={7:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5264] return p; [L5644] RET, EXPR ldv_successful_zalloc(232UL) VAL [__this_module={3266:3265}, 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)={-18446744073709551615: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 [L5749] RET ldv_initialize_hdlc_proto_1() [L5752] COND FALSE !(ldv_retval_1 != 0) VAL [__this_module={3266:3265}, 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={-18446744073709551615: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={3266:3265}, 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={-18446744073709551615: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={3266:3265}, 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={-18446744073709551615: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={3266:3265}, 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={-18446744073709551615: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={3266:3265}, 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={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5471] int result ; VAL [\old(last_index)=0, __this_module={3266:3265}, 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={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, skb={-18446744073709551615:0}, skb={-18446744073709551615:0}] [L5473] CALL assume_abort_if_not(((void*)(skb)) != ((void*) 0)) VAL [\old(cond)=1, \old(last_index)=0, __this_module={3266:3265}, 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={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5259] COND FALSE !(!cond) [L5473] RET assume_abort_if_not(((void*)(skb)) != ((void*) 0)) VAL [\old(last_index)=0, __this_module={3266:3265}, 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={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, skb={-18446744073709551615:0}, skb={-18446744073709551615:0}] [L5474] EXPR skb->data VAL [\old(last_index)=0, __this_module={3266:3265}, 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={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, skb={-18446744073709551615:0}, skb={-18446744073709551615:0}, skb->data={3267:0}] [L5474] CALL assume_abort_if_not(((void*)((skb->data))) != ((void*) 0)) VAL [\old(cond)=1, \old(last_index)=0, __this_module={3266:3265}, 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={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5259] COND FALSE !(!cond) [L5474] RET assume_abort_if_not(((void*)((skb->data))) != ((void*) 0)) VAL [\old(last_index)=0, __this_module={3266:3265}, 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={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, skb={-18446744073709551615:0}, skb={-18446744073709551615:0}, skb->data={3267:0}] [L5475] skb->data [L5476] case 0: [L5484] case 1: [L5496] case 2: [L5497] CALL, EXPR lapb_disconnect_request(dev) [L6080] return __VERIFIER_nondet_int(); [L5497] RET, EXPR lapb_disconnect_request(dev) [L5497] result = lapb_disconnect_request(dev) [L5498] COND TRUE result != 0 VAL [\old(last_index)=0, __this_module={3266:3265}, 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={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, result=4, set_impl={8:0}, skb={-18446744073709551615:0}, skb={-18446744073709551615:0}, skb->data=258skb->data={3267:0}] [L5499] COND TRUE result == 4 [L5500] CALL x25_disconnected(dev, 0) [L5435] CALL x25_connect_disconnect(dev, reason, 2) VAL [\old(last_index)=0, __this_module={3266:3265}, 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={-18446744073709551615: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={3266:3265}, 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={-18446744073709551615: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={3266:3265}, 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={-18446744073709551615: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={3266:3265}, 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={-18446744073709551615: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={3266:3265}, 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={-18446744073709551615: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={3266:3265}, calloc(1UL, __size)={-36893488147419103232: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={-18446744073709551615: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={3266:3265}, calloc(1UL, __size)={-36893488147419103232: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={-36893488147419103232:0}, proto={7:0}, proto_group0={-18446744073709551615: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={3266:3265}, 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={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5259] COND FALSE !(!cond) [L5263] RET assume_abort_if_not(p != (void *)0) VAL [\old(__size)=248, \old(last_index)=0, __size=248, __this_module={3266:3265}, calloc(1UL, __size)={-36893488147419103232: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={-36893488147419103232:0}, proto={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5264] return p; [L5978] RET, EXPR ldv_successful_zalloc(sizeof(struct sk_buff___0 )) VAL [\old(last_index)=0, __this_module={3266:3265}, 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 ))={-36893488147419103232:0}, proto={7:0}, proto_group0={-18446744073709551615: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={3266:3265}, 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={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, skb={-36893488147419103232:0}, tmp___7={-36893488147419103232: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={3266:3265}, e={-36893488147419103232:0}, e={-36893488147419103232: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={-18446744073709551615: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={3266:3265}, e={-36893488147419103232:0}, e={-36893488147419103232: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={-18446744073709551615: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={3266:3265}, e={-36893488147419103232:0}, e={-36893488147419103232: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={-18446744073709551615: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={3266:3265}, e={-36893488147419103232:0}, e={-36893488147419103232: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={-18446744073709551615: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={-36893488147419103232:0}, __this_module={3266:3265}, 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={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, skb={-36893488147419103232:0}, tmp___7={-36893488147419103232:0}] [L5816] RET, EXPR ldv_skb_alloc() VAL [\old(last_index)=0, \old(length)=1, __this_module={3266:3265}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_skb_alloc()={-36893488147419103232:0}, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, length=1, proto={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5816] tmp = ldv_skb_alloc() [L5817] return (tmp); [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) [L5435] RET x25_connect_disconnect(dev, reason, 2) VAL [\old(last_index)=0, \old(reason)=0, __this_module={3266:3265}, 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={-18446744073709551615:0}, proto_group1={-3:0}, reason=0, ref_cnt=0, set_impl={8:0}] [L5500] RET x25_disconnected(dev, 0) [L5512] CALL ldv_skb_free(skb) VAL [\old(last_index)=1, __this_module={3266:3265}, 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={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, skb={-18446744073709551615:0}] [L5998] CALL ldv_set_remove(LDV_SKBS, skb) VAL [\old(last_index)=1, __this_module={3266:3265}, e={-18446744073709551615: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={-18446744073709551615: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={3266:3265}, deleted_index=-1, e={-18446744073709551615:0}, e={-18446744073709551615: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={-18446744073709551615: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={3266:3265}, deleted_index=-1, e={-18446744073709551615:0}, e={-18446744073709551615: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={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={8:0}] [L5882] COND TRUE i < last_index [L5886] EXPR set_impl[i] VAL [\old(last_index)=1, __this_module={3266:3265}, deleted_index=-1, e={-18446744073709551615:0}, e={-18446744073709551615: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={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={8:0}, set_impl[i]={-36893488147419103232:0}] [L5886] COND FALSE !((unsigned long )set_impl[i] == (unsigned long )e) [L5891] i = i + 1 VAL [\old(last_index)=1, __this_module={3266:3265}, deleted_index=-1, e={-18446744073709551615:0}, e={-18446744073709551615: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={-18446744073709551615: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={3266:3265}, deleted_index=-1, e={-18446744073709551615:0}, e={-18446744073709551615: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={-18446744073709551615: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={3266:3265}, deleted_index=-1, e={-18446744073709551615:0}, e={-18446744073709551615: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={-18446744073709551615: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={3266:3265}, deleted_index=-1, e={-18446744073709551615:0}, e={-18446744073709551615: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={-18446744073709551615: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={3266:3265}, 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={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, skb={-18446744073709551615:0}, skb={-18446744073709551615:0}] [L5512] RET ldv_skb_free(skb) VAL [\old(last_index)=0, __this_module={3266:3265}, 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={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, result=4, set_impl={8:0}, skb={-18446744073709551615:0}, skb={-18446744073709551615:0}, skb->data=258skb->data={3267:0}] [L5513] return (0); VAL [\old(last_index)=0, \result=0, __this_module={3266:3265}, 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={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, result=4, set_impl={8:0}, skb={-18446744073709551615:0}, skb={-18446744073709551615:0}, skb->data={3267:0}skb->data=258] [L5672] RET x25_xmit(proto_group0, proto_group1) VAL [__this_module={3266:3265}, 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={-18446744073709551615: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={3266:3265}, 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={-18446744073709551615: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={3266:3265}, 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={-18446744073709551615: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={3266:3265}, 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={-18446744073709551615: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={3266:3265}, 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={-18446744073709551615: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={3266:3265}, 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={-18446744073709551615: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); [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={3266:3265}, 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={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, tmp___7=0] [L6047] CALL ldv_error() VAL [__this_module={3266:3265}, 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={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5320] reach_error() VAL [__this_module={3266:3265}, 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={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 18 procedures, 168 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.4s, OverallIterations: 9, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1769 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1719 mSDsluCounter, 4589 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2874 mSDsCounter, 551 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2449 IncrementalHoareTripleChecker+Invalid, 3000 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 551 mSolverCounterUnsat, 1715 mSDtfsCounter, 2449 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1456occurred in iteration=8, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 8 MinimizatonAttempts, 798 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 774 NumberOfCodeBlocks, 774 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 643 ConstructedInterpolants, 0 QuantifiedInterpolants, 1094 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 341/341 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-11-20 19:50:10,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9566dab1-d464-477b-8ff0-a7562f42f5bf/bin/utaipan-6cKwYrpEi9/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