/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-net--sched--sch_cbq.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 13:27:01,320 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 13:27:01,325 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 13:27:01,383 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 13:27:01,384 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 13:27:01,389 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 13:27:01,394 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 13:27:01,417 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 13:27:01,421 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 13:27:01,428 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 13:27:01,429 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 13:27:01,432 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 13:27:01,433 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 13:27:01,435 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 13:27:01,437 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 13:27:01,443 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 13:27:01,444 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 13:27:01,446 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 13:27:01,449 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 13:27:01,458 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 13:27:01,460 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 13:27:01,463 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 13:27:01,465 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 13:27:01,467 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 13:27:01,477 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 13:27:01,477 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 13:27:01,478 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 13:27:01,480 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 13:27:01,481 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 13:27:01,482 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 13:27:01,482 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 13:27:01,483 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 13:27:01,485 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 13:27:01,486 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 13:27:01,488 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 13:27:01,488 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 13:27:01,489 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 13:27:01,489 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 13:27:01,489 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 13:27:01,490 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 13:27:01,491 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 13:27:01,492 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf [2022-10-16 13:27:01,548 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 13:27:01,548 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 13:27:01,549 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 13:27:01,549 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 13:27:01,550 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 13:27:01,551 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 13:27:01,553 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 13:27:01,554 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 13:27:01,554 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 13:27:01,555 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 13:27:01,556 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 13:27:01,556 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 13:27:01,556 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 13:27:01,556 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 13:27:01,556 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 13:27:01,557 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 13:27:01,557 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 13:27:01,557 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 13:27:01,557 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 13:27:01,557 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 13:27:01,558 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 13:27:01,558 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 13:27:01,558 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 13:27:01,558 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 13:27:01,559 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 13:27:01,559 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 13:27:01,559 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 13:27:01,559 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 13:27:01,559 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 13:27:01,560 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 13:27:01,560 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 13:27:01,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 13:27:01,561 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 13:27:01,561 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-16 13:27:01,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 13:27:02,021 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 13:27:02,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 13:27:02,026 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 13:27:02,027 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 13:27:02,029 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-net--sched--sch_cbq.ko-entry_point.cil.out.i [2022-10-16 13:27:02,127 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca325015d/70ad086d5de7412493e63b7a91af3cc9/FLAG2a8cac86a [2022-10-16 13:27:03,342 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 13:27:03,343 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-net--sched--sch_cbq.ko-entry_point.cil.out.i [2022-10-16 13:27:03,382 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca325015d/70ad086d5de7412493e63b7a91af3cc9/FLAG2a8cac86a [2022-10-16 13:27:03,661 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca325015d/70ad086d5de7412493e63b7a91af3cc9 [2022-10-16 13:27:03,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 13:27:03,670 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 13:27:03,676 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 13:27:03,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 13:27:03,681 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 13:27:03,682 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:27:03" (1/1) ... [2022-10-16 13:27:03,683 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cc0a478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:03, skipping insertion in model container [2022-10-16 13:27:03,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:27:03" (1/1) ... [2022-10-16 13:27:03,692 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 13:27:03,895 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 13:27:04,532 WARN L1251 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [5334] [2022-10-16 13:27:04,533 WARN L1251 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [5335-5336] [2022-10-16 13:27:04,877 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-net--sched--sch_cbq.ko-entry_point.cil.out.i[160045,160058] [2022-10-16 13:27:06,058 WARN L611 FunctionHandler]: implicit declaration of function ldv_xmalloc [2022-10-16 13:27:06,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 13:27:06,091 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 13:27:06,290 WARN L1251 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [5334] [2022-10-16 13:27:06,290 WARN L1251 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [5335-5336] [2022-10-16 13:27:06,305 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-net--sched--sch_cbq.ko-entry_point.cil.out.i[160045,160058] [2022-10-16 13:27:06,813 WARN L611 FunctionHandler]: implicit declaration of function ldv_xmalloc [2022-10-16 13:27:06,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 13:27:06,900 INFO L208 MainTranslator]: Completed translation [2022-10-16 13:27:06,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:06 WrapperNode [2022-10-16 13:27:06,901 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 13:27:06,903 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 13:27:06,903 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 13:27:06,903 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 13:27:06,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:06" (1/1) ... [2022-10-16 13:27:07,018 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:06" (1/1) ... [2022-10-16 13:27:07,235 INFO L138 Inliner]: procedures = 228, calls = 1503, calls flagged for inlining = 97, calls inlined = 94, statements flattened = 4035 [2022-10-16 13:27:07,236 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 13:27:07,237 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 13:27:07,237 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 13:27:07,237 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 13:27:07,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:06" (1/1) ... [2022-10-16 13:27:07,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:06" (1/1) ... [2022-10-16 13:27:07,283 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:06" (1/1) ... [2022-10-16 13:27:07,284 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:06" (1/1) ... [2022-10-16 13:27:07,516 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:06" (1/1) ... [2022-10-16 13:27:07,558 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:06" (1/1) ... [2022-10-16 13:27:07,626 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:06" (1/1) ... [2022-10-16 13:27:07,642 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:06" (1/1) ... [2022-10-16 13:27:07,682 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 13:27:07,683 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 13:27:07,684 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 13:27:07,684 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 13:27:07,685 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:06" (1/1) ... [2022-10-16 13:27:07,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 13:27:07,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:27:07,726 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-16 13:27:07,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-16 13:27:07,791 INFO L130 BoogieDeclarations]: Found specification of procedure cbq_reclassify [2022-10-16 13:27:07,792 INFO L138 BoogieDeclarations]: Found implementation of procedure cbq_reclassify [2022-10-16 13:27:07,792 INFO L130 BoogieDeclarations]: Found specification of procedure qdisc_create_dflt [2022-10-16 13:27:07,792 INFO L138 BoogieDeclarations]: Found implementation of procedure qdisc_create_dflt [2022-10-16 13:27:07,792 INFO L130 BoogieDeclarations]: Found specification of procedure cbq_set_police [2022-10-16 13:27:07,792 INFO L138 BoogieDeclarations]: Found implementation of procedure cbq_set_police [2022-10-16 13:27:07,793 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-10-16 13:27:07,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-10-16 13:27:07,793 INFO L130 BoogieDeclarations]: Found specification of procedure qdisc_pkt_len [2022-10-16 13:27:07,793 INFO L138 BoogieDeclarations]: Found implementation of procedure qdisc_pkt_len [2022-10-16 13:27:07,793 INFO L130 BoogieDeclarations]: Found specification of procedure cbq_reset [2022-10-16 13:27:07,793 INFO L138 BoogieDeclarations]: Found implementation of procedure cbq_reset [2022-10-16 13:27:07,794 INFO L130 BoogieDeclarations]: Found specification of procedure qdisc_reset [2022-10-16 13:27:07,794 INFO L138 BoogieDeclarations]: Found implementation of procedure qdisc_reset [2022-10-16 13:27:07,794 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_trim [2022-10-16 13:27:07,794 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_trim [2022-10-16 13:27:07,794 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-10-16 13:27:07,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-10-16 13:27:07,794 INFO L130 BoogieDeclarations]: Found specification of procedure qdisc_put_rtab [2022-10-16 13:27:07,795 INFO L138 BoogieDeclarations]: Found implementation of procedure qdisc_put_rtab [2022-10-16 13:27:07,795 INFO L130 BoogieDeclarations]: Found specification of procedure cbq_dump_class_stats [2022-10-16 13:27:07,795 INFO L138 BoogieDeclarations]: Found implementation of procedure cbq_dump_class_stats [2022-10-16 13:27:07,795 INFO L130 BoogieDeclarations]: Found specification of procedure nla_nest_cancel [2022-10-16 13:27:07,795 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_nest_cancel [2022-10-16 13:27:07,795 INFO L130 BoogieDeclarations]: Found specification of procedure cbq_ovl_classic [2022-10-16 13:27:07,796 INFO L138 BoogieDeclarations]: Found implementation of procedure cbq_ovl_classic [2022-10-16 13:27:07,796 INFO L130 BoogieDeclarations]: Found specification of procedure cbq_set_overlimit [2022-10-16 13:27:07,796 INFO L138 BoogieDeclarations]: Found implementation of procedure cbq_set_overlimit [2022-10-16 13:27:07,796 INFO L130 BoogieDeclarations]: Found specification of procedure cbq_normalize_quanta [2022-10-16 13:27:07,796 INFO L138 BoogieDeclarations]: Found implementation of procedure cbq_normalize_quanta [2022-10-16 13:27:07,796 INFO L130 BoogieDeclarations]: Found specification of procedure qdisc_enqueue [2022-10-16 13:27:07,797 INFO L138 BoogieDeclarations]: Found implementation of procedure qdisc_enqueue [2022-10-16 13:27:07,797 INFO L130 BoogieDeclarations]: Found specification of procedure cbq_delete [2022-10-16 13:27:07,797 INFO L138 BoogieDeclarations]: Found implementation of procedure cbq_delete [2022-10-16 13:27:07,797 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-10-16 13:27:07,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-10-16 13:27:07,797 INFO L130 BoogieDeclarations]: Found specification of procedure cbq_dump [2022-10-16 13:27:07,798 INFO L138 BoogieDeclarations]: Found implementation of procedure cbq_dump [2022-10-16 13:27:07,798 INFO L130 BoogieDeclarations]: Found specification of procedure sch_tree_unlock [2022-10-16 13:27:07,798 INFO L138 BoogieDeclarations]: Found implementation of procedure sch_tree_unlock [2022-10-16 13:27:07,798 INFO L130 BoogieDeclarations]: Found specification of procedure cbq_link_class [2022-10-16 13:27:07,798 INFO L138 BoogieDeclarations]: Found implementation of procedure cbq_link_class [2022-10-16 13:27:07,798 INFO L130 BoogieDeclarations]: Found specification of procedure nla_nest_start [2022-10-16 13:27:07,799 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_nest_start [2022-10-16 13:27:07,799 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-10-16 13:27:07,799 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-10-16 13:27:07,800 INFO L130 BoogieDeclarations]: Found specification of procedure cbq_dump_stats [2022-10-16 13:27:07,800 INFO L138 BoogieDeclarations]: Found implementation of procedure cbq_dump_stats [2022-10-16 13:27:07,800 INFO L130 BoogieDeclarations]: Found specification of procedure gnet_stats_copy_app [2022-10-16 13:27:07,800 INFO L138 BoogieDeclarations]: Found implementation of procedure gnet_stats_copy_app [2022-10-16 13:27:07,800 INFO L130 BoogieDeclarations]: Found specification of procedure qdisc_root_sleeping_lock [2022-10-16 13:27:07,800 INFO L138 BoogieDeclarations]: Found implementation of procedure qdisc_root_sleeping_lock [2022-10-16 13:27:07,801 INFO L130 BoogieDeclarations]: Found specification of procedure cbq_set_lss [2022-10-16 13:27:07,801 INFO L138 BoogieDeclarations]: Found implementation of procedure cbq_set_lss [2022-10-16 13:27:07,801 INFO L130 BoogieDeclarations]: Found specification of procedure cbq_destroy [2022-10-16 13:27:07,801 INFO L138 BoogieDeclarations]: Found implementation of procedure cbq_destroy [2022-10-16 13:27:07,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 13:27:07,801 INFO L130 BoogieDeclarations]: Found specification of procedure qdisc_unthrottled [2022-10-16 13:27:07,802 INFO L138 BoogieDeclarations]: Found implementation of procedure qdisc_unthrottled [2022-10-16 13:27:07,802 INFO L130 BoogieDeclarations]: Found specification of procedure cbq_class_lookup [2022-10-16 13:27:07,802 INFO L138 BoogieDeclarations]: Found implementation of procedure cbq_class_lookup [2022-10-16 13:27:07,802 INFO L130 BoogieDeclarations]: Found specification of procedure cbq_dequeue_prio [2022-10-16 13:27:07,802 INFO L138 BoogieDeclarations]: Found implementation of procedure cbq_dequeue_prio [2022-10-16 13:27:07,803 INFO L130 BoogieDeclarations]: Found specification of procedure psched_get_time [2022-10-16 13:27:07,803 INFO L138 BoogieDeclarations]: Found implementation of procedure psched_get_time [2022-10-16 13:27:07,803 INFO L130 BoogieDeclarations]: Found specification of procedure cbq_set_fopt [2022-10-16 13:27:07,803 INFO L138 BoogieDeclarations]: Found implementation of procedure cbq_set_fopt [2022-10-16 13:27:07,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-16 13:27:07,803 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-10-16 13:27:07,804 INFO L130 BoogieDeclarations]: Found specification of procedure skb_end_pointer [2022-10-16 13:27:07,804 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_end_pointer [2022-10-16 13:27:07,804 INFO L130 BoogieDeclarations]: Found specification of procedure cbq_dequeue_1 [2022-10-16 13:27:07,804 INFO L138 BoogieDeclarations]: Found implementation of procedure cbq_dequeue_1 [2022-10-16 13:27:07,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_u32 [2022-10-16 13:27:07,804 INFO L130 BoogieDeclarations]: Found specification of procedure cbq_activate_class [2022-10-16 13:27:07,805 INFO L138 BoogieDeclarations]: Found implementation of procedure cbq_activate_class [2022-10-16 13:27:07,805 INFO L130 BoogieDeclarations]: Found specification of procedure nla_nest_end [2022-10-16 13:27:07,805 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_nest_end [2022-10-16 13:27:07,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 13:27:07,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-10-16 13:27:07,805 INFO L130 BoogieDeclarations]: Found specification of procedure tcf_destroy_chain [2022-10-16 13:27:07,806 INFO L138 BoogieDeclarations]: Found implementation of procedure tcf_destroy_chain [2022-10-16 13:27:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure cbq_sync_defmap [2022-10-16 13:27:07,806 INFO L138 BoogieDeclarations]: Found implementation of procedure cbq_sync_defmap [2022-10-16 13:27:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure nla_data [2022-10-16 13:27:07,806 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_data [2022-10-16 13:27:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure cbq_adjust_levels [2022-10-16 13:27:07,807 INFO L138 BoogieDeclarations]: Found implementation of procedure cbq_adjust_levels [2022-10-16 13:27:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure cbq_bind_filter [2022-10-16 13:27:07,807 INFO L138 BoogieDeclarations]: Found implementation of procedure cbq_bind_filter [2022-10-16 13:27:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2022-10-16 13:27:07,807 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2022-10-16 13:27:07,808 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-10-16 13:27:07,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-10-16 13:27:07,808 INFO L130 BoogieDeclarations]: Found specification of procedure cbq_enqueue [2022-10-16 13:27:07,808 INFO L138 BoogieDeclarations]: Found implementation of procedure cbq_enqueue [2022-10-16 13:27:07,808 INFO L130 BoogieDeclarations]: Found specification of procedure qdisc_peek_dequeued [2022-10-16 13:27:07,808 INFO L138 BoogieDeclarations]: Found implementation of procedure qdisc_peek_dequeued [2022-10-16 13:27:07,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 13:27:07,809 INFO L130 BoogieDeclarations]: Found specification of procedure cbq_mark_toplevel [2022-10-16 13:27:07,809 INFO L138 BoogieDeclarations]: Found implementation of procedure cbq_mark_toplevel [2022-10-16 13:27:07,809 INFO L130 BoogieDeclarations]: Found specification of procedure cbq_get [2022-10-16 13:27:07,809 INFO L138 BoogieDeclarations]: Found implementation of procedure cbq_get [2022-10-16 13:27:07,809 INFO L130 BoogieDeclarations]: Found specification of procedure nla_parse_nested [2022-10-16 13:27:07,810 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_parse_nested [2022-10-16 13:27:07,810 INFO L130 BoogieDeclarations]: Found specification of procedure hrtimer_get_expires [2022-10-16 13:27:07,810 INFO L138 BoogieDeclarations]: Found implementation of procedure hrtimer_get_expires [2022-10-16 13:27:07,810 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-10-16 13:27:07,810 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-10-16 13:27:07,810 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-10-16 13:27:07,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-10-16 13:27:07,811 INFO L130 BoogieDeclarations]: Found specification of procedure cbq_reshape_fail [2022-10-16 13:27:07,811 INFO L138 BoogieDeclarations]: Found implementation of procedure cbq_reshape_fail [2022-10-16 13:27:07,811 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-10-16 13:27:07,811 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-10-16 13:27:07,811 INFO L130 BoogieDeclarations]: Found specification of procedure qdisc_root_sleeping [2022-10-16 13:27:07,812 INFO L138 BoogieDeclarations]: Found implementation of procedure qdisc_root_sleeping [2022-10-16 13:27:07,812 INFO L130 BoogieDeclarations]: Found specification of procedure cbq_init [2022-10-16 13:27:07,812 INFO L138 BoogieDeclarations]: Found implementation of procedure cbq_init [2022-10-16 13:27:07,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 13:27:07,812 INFO L130 BoogieDeclarations]: Found specification of procedure cbq_dump_class [2022-10-16 13:27:07,812 INFO L138 BoogieDeclarations]: Found implementation of procedure cbq_dump_class [2022-10-16 13:27:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure sch_tree_lock [2022-10-16 13:27:07,813 INFO L138 BoogieDeclarations]: Found implementation of procedure sch_tree_lock [2022-10-16 13:27:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure cbq_dump_attr [2022-10-16 13:27:07,813 INFO L138 BoogieDeclarations]: Found implementation of procedure cbq_dump_attr [2022-10-16 13:27:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-10-16 13:27:07,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-10-16 13:27:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure cbq_find_tcf [2022-10-16 13:27:07,814 INFO L138 BoogieDeclarations]: Found implementation of procedure cbq_find_tcf [2022-10-16 13:27:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure cbq_drop [2022-10-16 13:27:07,814 INFO L138 BoogieDeclarations]: Found implementation of procedure cbq_drop [2022-10-16 13:27:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-16 13:27:07,815 INFO L130 BoogieDeclarations]: Found specification of procedure cbq_rmprio [2022-10-16 13:27:07,815 INFO L138 BoogieDeclarations]: Found implementation of procedure cbq_rmprio [2022-10-16 13:27:07,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 13:27:07,815 INFO L130 BoogieDeclarations]: Found specification of procedure qdisc_priv [2022-10-16 13:27:07,815 INFO L138 BoogieDeclarations]: Found implementation of procedure qdisc_priv [2022-10-16 13:27:07,815 INFO L130 BoogieDeclarations]: Found specification of procedure cbq_walk [2022-10-16 13:27:07,816 INFO L138 BoogieDeclarations]: Found implementation of procedure cbq_walk [2022-10-16 13:27:07,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-16 13:27:07,816 INFO L130 BoogieDeclarations]: Found specification of procedure qdisc_get_rtab [2022-10-16 13:27:07,816 INFO L138 BoogieDeclarations]: Found implementation of procedure qdisc_get_rtab [2022-10-16 13:27:07,816 INFO L130 BoogieDeclarations]: Found specification of procedure nla_put [2022-10-16 13:27:07,816 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_put [2022-10-16 13:27:07,817 INFO L130 BoogieDeclarations]: Found specification of procedure cbq_addprio [2022-10-16 13:27:07,817 INFO L138 BoogieDeclarations]: Found implementation of procedure cbq_addprio [2022-10-16 13:27:07,817 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-10-16 13:27:07,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-10-16 13:27:07,817 INFO L130 BoogieDeclarations]: Found specification of procedure cbq_change_class [2022-10-16 13:27:07,817 INFO L138 BoogieDeclarations]: Found implementation of procedure cbq_change_class [2022-10-16 13:27:07,817 INFO L130 BoogieDeclarations]: Found specification of procedure cbq_deactivate_class [2022-10-16 13:27:07,818 INFO L138 BoogieDeclarations]: Found implementation of procedure cbq_deactivate_class [2022-10-16 13:27:07,818 INFO L130 BoogieDeclarations]: Found specification of procedure qdisc_dev [2022-10-16 13:27:07,818 INFO L138 BoogieDeclarations]: Found implementation of procedure qdisc_dev [2022-10-16 13:27:07,818 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-10-16 13:27:07,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-10-16 13:27:07,818 INFO L130 BoogieDeclarations]: Found specification of procedure ffz [2022-10-16 13:27:07,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ffz [2022-10-16 13:27:07,819 INFO L130 BoogieDeclarations]: Found specification of procedure cbq_qlen_notify [2022-10-16 13:27:07,819 INFO L138 BoogieDeclarations]: Found implementation of procedure cbq_qlen_notify [2022-10-16 13:27:07,819 INFO L130 BoogieDeclarations]: Found specification of procedure cbq_destroy_class [2022-10-16 13:27:07,819 INFO L138 BoogieDeclarations]: Found implementation of procedure cbq_destroy_class [2022-10-16 13:27:07,819 INFO L130 BoogieDeclarations]: Found specification of procedure qdisc_l2t [2022-10-16 13:27:07,819 INFO L138 BoogieDeclarations]: Found implementation of procedure qdisc_l2t [2022-10-16 13:27:07,819 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-10-16 13:27:07,820 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-10-16 13:27:07,820 INFO L130 BoogieDeclarations]: Found specification of procedure cbq_graft [2022-10-16 13:27:07,820 INFO L138 BoogieDeclarations]: Found implementation of procedure cbq_graft [2022-10-16 13:27:07,820 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-10-16 13:27:07,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-10-16 13:27:07,820 INFO L130 BoogieDeclarations]: Found specification of procedure cbq_set_wrr [2022-10-16 13:27:07,820 INFO L138 BoogieDeclarations]: Found implementation of procedure cbq_set_wrr [2022-10-16 13:27:07,821 INFO L130 BoogieDeclarations]: Found specification of procedure cbq_dequeue [2022-10-16 13:27:07,821 INFO L138 BoogieDeclarations]: Found implementation of procedure cbq_dequeue [2022-10-16 13:27:07,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 13:27:07,821 INFO L130 BoogieDeclarations]: Found specification of procedure cbq_put [2022-10-16 13:27:07,821 INFO L138 BoogieDeclarations]: Found implementation of procedure cbq_put [2022-10-16 13:27:07,821 INFO L130 BoogieDeclarations]: Found specification of procedure qdisc_tree_decrease_qlen [2022-10-16 13:27:07,822 INFO L138 BoogieDeclarations]: Found implementation of procedure qdisc_tree_decrease_qlen [2022-10-16 13:27:07,822 INFO L130 BoogieDeclarations]: Found specification of procedure skb_tail_pointer [2022-10-16 13:27:07,822 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_tail_pointer [2022-10-16 13:27:07,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 13:27:07,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 13:27:07,822 INFO L130 BoogieDeclarations]: Found specification of procedure cbq_leaf [2022-10-16 13:27:07,823 INFO L138 BoogieDeclarations]: Found implementation of procedure cbq_leaf [2022-10-16 13:27:07,823 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2022-10-16 13:27:07,823 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2022-10-16 13:27:08,772 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 13:27:08,778 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 13:27:08,892 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-10-16 13:27:16,572 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 13:27:16,614 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 13:27:16,614 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-16 13:27:16,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:27:16 BoogieIcfgContainer [2022-10-16 13:27:16,622 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 13:27:16,625 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 13:27:16,625 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 13:27:16,629 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 13:27:16,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:27:03" (1/3) ... [2022-10-16 13:27:16,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aa87b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:27:16, skipping insertion in model container [2022-10-16 13:27:16,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:06" (2/3) ... [2022-10-16 13:27:16,632 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aa87b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:27:16, skipping insertion in model container [2022-10-16 13:27:16,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:27:16" (3/3) ... [2022-10-16 13:27:16,634 INFO L112 eAbstractionObserver]: Analyzing ICFG 43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-net--sched--sch_cbq.ko-entry_point.cil.out.i [2022-10-16 13:27:16,658 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 13:27:16,659 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 132 error locations. [2022-10-16 13:27:16,818 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 13:27:16,827 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;@2ca7e100, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 13:27:16,828 INFO L358 AbstractCegarLoop]: Starting to check reachability of 132 error locations. [2022-10-16 13:27:16,841 INFO L276 IsEmpty]: Start isEmpty. Operand has 1803 states, 1286 states have (on average 1.4525660964230172) internal successors, (1868), 1441 states have internal predecessors, (1868), 298 states have call successors, (298), 87 states have call predecessors, (298), 86 states have return successors, (294), 292 states have call predecessors, (294), 294 states have call successors, (294) [2022-10-16 13:27:16,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-10-16 13:27:16,865 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:27:16,866 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-16 13:27:16,866 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [cbq_resetErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cbq_resetErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, cbq_getErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 129 more)] === [2022-10-16 13:27:16,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:27:16,872 INFO L85 PathProgramCache]: Analyzing trace with hash 762313434, now seen corresponding path program 1 times [2022-10-16 13:27:16,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:27:16,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783205067] [2022-10-16 13:27:16,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:27:16,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:27:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:17,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:27:17,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:17,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:27:17,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:17,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:27:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:17,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 13:27:17,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:17,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-16 13:27:17,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:17,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 13:27:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:17,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-10-16 13:27:17,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:17,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-10-16 13:27:17,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:17,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 13:27:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:17,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-10-16 13:27:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:17,710 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-10-16 13:27:17,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:27:17,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783205067] [2022-10-16 13:27:17,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783205067] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:27:17,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:27:17,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 13:27:17,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956412999] [2022-10-16 13:27:17,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:27:17,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 13:27:17,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:27:17,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 13:27:17,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 13:27:17,794 INFO L87 Difference]: Start difference. First operand has 1803 states, 1286 states have (on average 1.4525660964230172) internal successors, (1868), 1441 states have internal predecessors, (1868), 298 states have call successors, (298), 87 states have call predecessors, (298), 86 states have return successors, (294), 292 states have call predecessors, (294), 294 states have call successors, (294) Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-10-16 13:27:25,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-16 13:27:27,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:27:27,133 INFO L93 Difference]: Finished difference Result 5179 states and 7189 transitions. [2022-10-16 13:27:27,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 13:27:27,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 76 [2022-10-16 13:27:27,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:27:27,216 INFO L225 Difference]: With dead ends: 5179 [2022-10-16 13:27:27,216 INFO L226 Difference]: Without dead ends: 3353 [2022-10-16 13:27:27,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 13:27:27,248 INFO L413 NwaCegarLoop]: 2493 mSDtfsCounter, 2505 mSDsluCounter, 2620 mSDsCounter, 0 mSdLazyCounter, 2156 mSolverCounterSat, 648 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2652 SdHoareTripleChecker+Valid, 5113 SdHoareTripleChecker+Invalid, 2805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 648 IncrementalHoareTripleChecker+Valid, 2156 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-10-16 13:27:27,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2652 Valid, 5113 Invalid, 2805 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [648 Valid, 2156 Invalid, 1 Unknown, 0 Unchecked, 8.7s Time] [2022-10-16 13:27:27,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3353 states. [2022-10-16 13:27:27,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3353 to 2825. [2022-10-16 13:27:27,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2825 states, 2103 states have (on average 1.4407988587731813) internal successors, (3030), 2255 states have internal predecessors, (3030), 454 states have call successors, (454), 144 states have call predecessors, (454), 145 states have return successors, (457), 449 states have call predecessors, (457), 454 states have call successors, (457) [2022-10-16 13:27:27,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2825 states to 2825 states and 3941 transitions. [2022-10-16 13:27:27,676 INFO L78 Accepts]: Start accepts. Automaton has 2825 states and 3941 transitions. Word has length 76 [2022-10-16 13:27:27,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:27:27,679 INFO L495 AbstractCegarLoop]: Abstraction has 2825 states and 3941 transitions. [2022-10-16 13:27:27,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-10-16 13:27:27,679 INFO L276 IsEmpty]: Start isEmpty. Operand 2825 states and 3941 transitions. [2022-10-16 13:27:27,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-10-16 13:27:27,693 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:27:27,694 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-16 13:27:27,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 13:27:27,695 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [cbq_resetErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cbq_resetErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, cbq_getErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 129 more)] === [2022-10-16 13:27:27,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:27:27,696 INFO L85 PathProgramCache]: Analyzing trace with hash -2142803544, now seen corresponding path program 1 times [2022-10-16 13:27:27,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:27:27,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323882061] [2022-10-16 13:27:27,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:27:27,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:27:27,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:27,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:27:27,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:27,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:27:27,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:27,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:27:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:27,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 13:27:27,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:27,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-16 13:27:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:27,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 13:27:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:27,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-10-16 13:27:27,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:27,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-10-16 13:27:27,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:27,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 13:27:28,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:28,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-10-16 13:27:28,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:28,026 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-10-16 13:27:28,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:27:28,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323882061] [2022-10-16 13:27:28,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323882061] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:27:28,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:27:28,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 13:27:28,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361808417] [2022-10-16 13:27:28,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:27:28,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 13:27:28,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:27:28,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 13:27:28,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 13:27:28,035 INFO L87 Difference]: Start difference. First operand 2825 states and 3941 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-10-16 13:27:34,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-16 13:27:38,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-16 13:27:39,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:27:39,949 INFO L93 Difference]: Finished difference Result 7181 states and 10044 transitions. [2022-10-16 13:27:39,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 13:27:39,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 79 [2022-10-16 13:27:39,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:27:39,989 INFO L225 Difference]: With dead ends: 7181 [2022-10-16 13:27:39,990 INFO L226 Difference]: Without dead ends: 4386 [2022-10-16 13:27:40,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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-10-16 13:27:40,009 INFO L413 NwaCegarLoop]: 3057 mSDtfsCounter, 2094 mSDsluCounter, 2820 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 545 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2258 SdHoareTripleChecker+Valid, 5877 SdHoareTripleChecker+Invalid, 2884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 545 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2022-10-16 13:27:40,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2258 Valid, 5877 Invalid, 2884 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [545 Valid, 2337 Invalid, 2 Unknown, 0 Unchecked, 11.4s Time] [2022-10-16 13:27:40,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4386 states. [2022-10-16 13:27:40,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4386 to 3746. [2022-10-16 13:27:40,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3746 states, 2803 states have (on average 1.4306100606493044) internal successors, (4010), 2967 states have internal predecessors, (4010), 616 states have call successors, (616), 203 states have call predecessors, (616), 204 states have return successors, (621), 609 states have call predecessors, (621), 616 states have call successors, (621) [2022-10-16 13:27:40,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3746 states to 3746 states and 5247 transitions. [2022-10-16 13:27:40,330 INFO L78 Accepts]: Start accepts. Automaton has 3746 states and 5247 transitions. Word has length 79 [2022-10-16 13:27:40,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:27:40,334 INFO L495 AbstractCegarLoop]: Abstraction has 3746 states and 5247 transitions. [2022-10-16 13:27:40,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-10-16 13:27:40,334 INFO L276 IsEmpty]: Start isEmpty. Operand 3746 states and 5247 transitions. [2022-10-16 13:27:40,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-10-16 13:27:40,339 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:27:40,340 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 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] [2022-10-16 13:27:40,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 13:27:40,340 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [cbq_resetErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cbq_resetErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, cbq_getErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 129 more)] === [2022-10-16 13:27:40,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:27:40,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1642639224, now seen corresponding path program 1 times [2022-10-16 13:27:40,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:27:40,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208601597] [2022-10-16 13:27:40,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:27:40,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:27:40,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:40,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:27:40,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:40,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:27:40,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:40,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:27:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:40,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 13:27:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:40,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-16 13:27:40,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:40,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 13:27:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:40,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-10-16 13:27:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:40,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-10-16 13:27:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:40,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 13:27:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:40,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-10-16 13:27:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:40,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-10-16 13:27:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:40,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-10-16 13:27:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:40,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-10-16 13:27:40,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:40,948 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-10-16 13:27:40,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:27:40,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208601597] [2022-10-16 13:27:40,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208601597] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:27:40,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:27:40,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 13:27:40,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641964185] [2022-10-16 13:27:40,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:27:40,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 13:27:40,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:27:40,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 13:27:40,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-10-16 13:27:40,951 INFO L87 Difference]: Start difference. First operand 3746 states and 5247 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-10-16 13:27:54,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-16 13:27:55,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:27:55,687 INFO L93 Difference]: Finished difference Result 12387 states and 17386 transitions. [2022-10-16 13:27:55,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-16 13:27:55,688 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 107 [2022-10-16 13:27:55,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:27:55,760 INFO L225 Difference]: With dead ends: 12387 [2022-10-16 13:27:55,761 INFO L226 Difference]: Without dead ends: 8675 [2022-10-16 13:27:55,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-10-16 13:27:55,793 INFO L413 NwaCegarLoop]: 2739 mSDtfsCounter, 7130 mSDsluCounter, 6351 mSDsCounter, 0 mSdLazyCounter, 5896 mSolverCounterSat, 1970 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7446 SdHoareTripleChecker+Valid, 9090 SdHoareTripleChecker+Invalid, 7867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1970 IncrementalHoareTripleChecker+Valid, 5896 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.9s IncrementalHoareTripleChecker+Time [2022-10-16 13:27:55,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7446 Valid, 9090 Invalid, 7867 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1970 Valid, 5896 Invalid, 1 Unknown, 0 Unchecked, 13.9s Time] [2022-10-16 13:27:55,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8675 states. [2022-10-16 13:27:56,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8675 to 7303. [2022-10-16 13:27:56,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7303 states, 5607 states have (on average 1.4294631710362047) internal successors, (8015), 5812 states have internal predecessors, (8015), 1168 states have call successors, (1168), 402 states have call predecessors, (1168), 405 states have return successors, (1178), 1156 states have call predecessors, (1178), 1168 states have call successors, (1178) [2022-10-16 13:27:56,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7303 states to 7303 states and 10361 transitions. [2022-10-16 13:27:56,267 INFO L78 Accepts]: Start accepts. Automaton has 7303 states and 10361 transitions. Word has length 107 [2022-10-16 13:27:56,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:27:56,268 INFO L495 AbstractCegarLoop]: Abstraction has 7303 states and 10361 transitions. [2022-10-16 13:27:56,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-10-16 13:27:56,268 INFO L276 IsEmpty]: Start isEmpty. Operand 7303 states and 10361 transitions. [2022-10-16 13:27:56,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-10-16 13:27:56,271 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:27:56,272 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 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] [2022-10-16 13:27:56,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 13:27:56,272 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [cbq_resetErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cbq_resetErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, cbq_getErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 129 more)] === [2022-10-16 13:27:56,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:27:56,273 INFO L85 PathProgramCache]: Analyzing trace with hash 556993850, now seen corresponding path program 1 times [2022-10-16 13:27:56,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:27:56,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490733949] [2022-10-16 13:27:56,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:27:56,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:27:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:56,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:27:56,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:56,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:27:56,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:56,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:27:56,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:56,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 13:27:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:56,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-16 13:27:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:56,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 13:27:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:56,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-10-16 13:27:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:56,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-10-16 13:27:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:56,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 13:27:56,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:56,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-10-16 13:27:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:56,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-10-16 13:27:56,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:56,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-10-16 13:27:56,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:56,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-10-16 13:27:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:56,629 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2022-10-16 13:27:56,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:27:56,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490733949] [2022-10-16 13:27:56,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490733949] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:27:56,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:27:56,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 13:27:56,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070790304] [2022-10-16 13:27:56,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:27:56,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 13:27:56,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:27:56,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 13:27:56,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 13:27:56,633 INFO L87 Difference]: Start difference. First operand 7303 states and 10361 transitions. Second operand has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-10-16 13:28:03,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:28:03,414 INFO L93 Difference]: Finished difference Result 11456 states and 16278 transitions. [2022-10-16 13:28:03,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 13:28:03,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 110 [2022-10-16 13:28:03,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:28:03,495 INFO L225 Difference]: With dead ends: 11456 [2022-10-16 13:28:03,496 INFO L226 Difference]: Without dead ends: 11448 [2022-10-16 13:28:03,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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-10-16 13:28:03,503 INFO L413 NwaCegarLoop]: 2717 mSDtfsCounter, 3492 mSDsluCounter, 2731 mSDsCounter, 0 mSdLazyCounter, 2253 mSolverCounterSat, 842 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3703 SdHoareTripleChecker+Valid, 5448 SdHoareTripleChecker+Invalid, 3095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 842 IncrementalHoareTripleChecker+Valid, 2253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-10-16 13:28:03,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3703 Valid, 5448 Invalid, 3095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [842 Valid, 2253 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-10-16 13:28:03,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11448 states. [2022-10-16 13:28:03,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11448 to 9811. [2022-10-16 13:28:04,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9811 states, 7549 states have (on average 1.421512783150086) internal successors, (10731), 7785 states have internal predecessors, (10731), 1590 states have call successors, (1590), 545 states have call predecessors, (1590), 549 states have return successors, (1604), 1574 states have call predecessors, (1604), 1590 states have call successors, (1604) [2022-10-16 13:28:04,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9811 states to 9811 states and 13925 transitions. [2022-10-16 13:28:04,061 INFO L78 Accepts]: Start accepts. Automaton has 9811 states and 13925 transitions. Word has length 110 [2022-10-16 13:28:04,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:28:04,062 INFO L495 AbstractCegarLoop]: Abstraction has 9811 states and 13925 transitions. [2022-10-16 13:28:04,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-10-16 13:28:04,062 INFO L276 IsEmpty]: Start isEmpty. Operand 9811 states and 13925 transitions. [2022-10-16 13:28:04,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-10-16 13:28:04,065 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:28:04,065 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 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] [2022-10-16 13:28:04,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 13:28:04,066 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting cbq_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [cbq_resetErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cbq_resetErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, cbq_getErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 129 more)] === [2022-10-16 13:28:04,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:28:04,066 INFO L85 PathProgramCache]: Analyzing trace with hash 670895879, now seen corresponding path program 1 times [2022-10-16 13:28:04,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:28:04,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602032133] [2022-10-16 13:28:04,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:28:04,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:28:04,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 13:28:04,148 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-16 13:28:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 13:28:04,300 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-16 13:28:04,300 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-16 13:28:04,301 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location cbq_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (131 of 132 remaining) [2022-10-16 13:28:04,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_resetErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (130 of 132 remaining) [2022-10-16 13:28:04,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_resetErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (129 of 132 remaining) [2022-10-16 13:28:04,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_getErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (128 of 132 remaining) [2022-10-16 13:28:04,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_getErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (127 of 132 remaining) [2022-10-16 13:28:04,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location nla_parse_nestedErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (126 of 132 remaining) [2022-10-16 13:28:04,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location nla_parse_nestedErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (125 of 132 remaining) [2022-10-16 13:28:04,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_ovl_classicErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (124 of 132 remaining) [2022-10-16 13:28:04,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_ovl_classicErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (123 of 132 remaining) [2022-10-16 13:28:04,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_ovl_classicErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (122 of 132 remaining) [2022-10-16 13:28:04,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_ovl_classicErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (121 of 132 remaining) [2022-10-16 13:28:04,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_ovl_classicErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (120 of 132 remaining) [2022-10-16 13:28:04,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_ovl_classicErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (119 of 132 remaining) [2022-10-16 13:28:04,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_ovl_classicErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (118 of 132 remaining) [2022-10-16 13:28:04,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_ovl_classicErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (117 of 132 remaining) [2022-10-16 13:28:04,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_set_overlimitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (116 of 132 remaining) [2022-10-16 13:28:04,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_set_overlimitErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (115 of 132 remaining) [2022-10-16 13:28:04,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_set_overlimitErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (114 of 132 remaining) [2022-10-16 13:28:04,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_set_overlimitErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (113 of 132 remaining) [2022-10-16 13:28:04,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_normalize_quantaErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (112 of 132 remaining) [2022-10-16 13:28:04,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_normalize_quantaErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (111 of 132 remaining) [2022-10-16 13:28:04,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_normalize_quantaErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (110 of 132 remaining) [2022-10-16 13:28:04,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_normalize_quantaErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (109 of 132 remaining) [2022-10-16 13:28:04,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_normalize_quantaErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (108 of 132 remaining) [2022-10-16 13:28:04,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_normalize_quantaErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (107 of 132 remaining) [2022-10-16 13:28:04,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_initErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (106 of 132 remaining) [2022-10-16 13:28:04,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_initErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (105 of 132 remaining) [2022-10-16 13:28:04,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_deleteErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (104 of 132 remaining) [2022-10-16 13:28:04,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_deleteErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (103 of 132 remaining) [2022-10-16 13:28:04,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dropErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (102 of 132 remaining) [2022-10-16 13:28:04,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dropErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (101 of 132 remaining) [2022-10-16 13:28:04,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_rmprioErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (100 of 132 remaining) [2022-10-16 13:28:04,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_rmprioErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (99 of 132 remaining) [2022-10-16 13:28:04,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_set_lssErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (98 of 132 remaining) [2022-10-16 13:28:04,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_set_lssErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 132 remaining) [2022-10-16 13:28:04,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_walkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 132 remaining) [2022-10-16 13:28:04,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_walkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 132 remaining) [2022-10-16 13:28:04,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_walkErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 132 remaining) [2022-10-16 13:28:04,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_walkErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 132 remaining) [2022-10-16 13:28:04,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeue_prioErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 132 remaining) [2022-10-16 13:28:04,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeue_prioErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 132 remaining) [2022-10-16 13:28:04,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeue_prioErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 132 remaining) [2022-10-16 13:28:04,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeue_prioErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 132 remaining) [2022-10-16 13:28:04,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeue_prioErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 132 remaining) [2022-10-16 13:28:04,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeue_prioErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 132 remaining) [2022-10-16 13:28:04,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeue_prioErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 132 remaining) [2022-10-16 13:28:04,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeue_prioErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 132 remaining) [2022-10-16 13:28:04,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeue_prioErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 132 remaining) [2022-10-16 13:28:04,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeue_prioErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 132 remaining) [2022-10-16 13:28:04,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeue_prioErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 132 remaining) [2022-10-16 13:28:04,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeue_prioErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 132 remaining) [2022-10-16 13:28:04,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeue_prioErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 132 remaining) [2022-10-16 13:28:04,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeue_prioErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 132 remaining) [2022-10-16 13:28:04,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeue_prioErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 132 remaining) [2022-10-16 13:28:04,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeue_prioErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 132 remaining) [2022-10-16 13:28:04,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeue_prioErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 132 remaining) [2022-10-16 13:28:04,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeue_prioErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 132 remaining) [2022-10-16 13:28:04,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeue_prioErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 132 remaining) [2022-10-16 13:28:04,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeue_prioErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 132 remaining) [2022-10-16 13:28:04,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeue_prioErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 132 remaining) [2022-10-16 13:28:04,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeue_prioErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 132 remaining) [2022-10-16 13:28:04,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeue_prioErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 132 remaining) [2022-10-16 13:28:04,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeue_prioErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 132 remaining) [2022-10-16 13:28:04,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeue_prioErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 132 remaining) [2022-10-16 13:28:04,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeue_prioErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 132 remaining) [2022-10-16 13:28:04,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_addprioErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 132 remaining) [2022-10-16 13:28:04,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_addprioErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 132 remaining) [2022-10-16 13:28:04,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 132 remaining) [2022-10-16 13:28:04,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 132 remaining) [2022-10-16 13:28:04,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~intErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 132 remaining) [2022-10-16 13:28:04,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~intErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 132 remaining) [2022-10-16 13:28:04,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~intErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 132 remaining) [2022-10-16 13:28:04,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~intErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 132 remaining) [2022-10-16 13:28:04,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~intErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 132 remaining) [2022-10-16 13:28:04,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~intErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 132 remaining) [2022-10-16 13:28:04,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~intErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 132 remaining) [2022-10-16 13:28:04,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~intErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 132 remaining) [2022-10-16 13:28:04,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~intErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 132 remaining) [2022-10-16 13:28:04,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~intErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 132 remaining) [2022-10-16 13:28:04,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_change_classErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 132 remaining) [2022-10-16 13:28:04,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_change_classErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 132 remaining) [2022-10-16 13:28:04,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_deactivate_classErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 132 remaining) [2022-10-16 13:28:04,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_deactivate_classErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 132 remaining) [2022-10-16 13:28:04,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeue_1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 132 remaining) [2022-10-16 13:28:04,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeue_1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 132 remaining) [2022-10-16 13:28:04,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_activate_classErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 132 remaining) [2022-10-16 13:28:04,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_activate_classErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 132 remaining) [2022-10-16 13:28:04,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location nla_nest_endErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 132 remaining) [2022-10-16 13:28:04,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location nla_nest_endErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 132 remaining) [2022-10-16 13:28:04,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_sync_defmapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 132 remaining) [2022-10-16 13:28:04,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_sync_defmapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 132 remaining) [2022-10-16 13:28:04,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_sync_defmapErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 132 remaining) [2022-10-16 13:28:04,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_sync_defmapErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 132 remaining) [2022-10-16 13:28:04,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_sync_defmapErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 132 remaining) [2022-10-16 13:28:04,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_sync_defmapErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 132 remaining) [2022-10-16 13:28:04,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_sync_defmapErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 132 remaining) [2022-10-16 13:28:04,323 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_sync_defmapErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 132 remaining) [2022-10-16 13:28:04,323 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_bind_filterErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 132 remaining) [2022-10-16 13:28:04,323 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_bind_filterErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 132 remaining) [2022-10-16 13:28:04,323 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeueErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 132 remaining) [2022-10-16 13:28:04,323 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeueErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 132 remaining) [2022-10-16 13:28:04,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeueErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 132 remaining) [2022-10-16 13:28:04,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeueErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 132 remaining) [2022-10-16 13:28:04,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeueErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 132 remaining) [2022-10-16 13:28:04,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeueErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 132 remaining) [2022-10-16 13:28:04,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeueErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 132 remaining) [2022-10-16 13:28:04,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeueErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 132 remaining) [2022-10-16 13:28:04,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeueErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 132 remaining) [2022-10-16 13:28:04,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeueErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 132 remaining) [2022-10-16 13:28:04,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeueErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 132 remaining) [2022-10-16 13:28:04,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeueErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 132 remaining) [2022-10-16 13:28:04,326 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeueErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 132 remaining) [2022-10-16 13:28:04,326 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeueErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 132 remaining) [2022-10-16 13:28:04,326 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeueErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 132 remaining) [2022-10-16 13:28:04,326 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeueErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 132 remaining) [2022-10-16 13:28:04,326 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeueErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 132 remaining) [2022-10-16 13:28:04,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeueErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 132 remaining) [2022-10-16 13:28:04,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeueErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 132 remaining) [2022-10-16 13:28:04,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_dequeueErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 132 remaining) [2022-10-16 13:28:04,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cbq_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 132 remaining) [2022-10-16 13:28:04,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 132 remaining) [2022-10-16 13:28:04,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 132 remaining) [2022-10-16 13:28:04,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 132 remaining) [2022-10-16 13:28:04,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 132 remaining) [2022-10-16 13:28:04,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 132 remaining) [2022-10-16 13:28:04,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 132 remaining) [2022-10-16 13:28:04,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 132 remaining) [2022-10-16 13:28:04,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 132 remaining) [2022-10-16 13:28:04,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 132 remaining) [2022-10-16 13:28:04,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 132 remaining) [2022-10-16 13:28:04,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 132 remaining) [2022-10-16 13:28:04,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 132 remaining) [2022-10-16 13:28:04,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 13:28:04,334 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-10-16 13:28:04,341 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 13:28:04,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:28:04 BoogieIcfgContainer [2022-10-16 13:28:04,530 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 13:28:04,531 INFO L158 Benchmark]: Toolchain (without parser) took 60865.25ms. Allocated memory was 157.3MB in the beginning and 673.2MB in the end (delta: 515.9MB). Free memory was 120.4MB in the beginning and 237.5MB in the end (delta: -117.1MB). Peak memory consumption was 399.7MB. Max. memory is 8.0GB. [2022-10-16 13:28:04,531 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 157.3MB. Free memory was 127.6MB in the beginning and 127.5MB in the end (delta: 80.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 13:28:04,532 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3225.27ms. Allocated memory was 157.3MB in the beginning and 206.6MB in the end (delta: 49.3MB). Free memory was 120.3MB in the beginning and 132.1MB in the end (delta: -11.9MB). Peak memory consumption was 112.3MB. Max. memory is 8.0GB. [2022-10-16 13:28:04,532 INFO L158 Benchmark]: Boogie Procedure Inliner took 333.19ms. Allocated memory is still 206.6MB. Free memory was 132.1MB in the beginning and 108.0MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-10-16 13:28:04,533 INFO L158 Benchmark]: Boogie Preprocessor took 445.43ms. Allocated memory was 206.6MB in the beginning and 311.4MB in the end (delta: 104.9MB). Free memory was 108.0MB in the beginning and 233.8MB in the end (delta: -125.8MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. [2022-10-16 13:28:04,533 INFO L158 Benchmark]: RCFGBuilder took 8938.47ms. Allocated memory was 311.4MB in the beginning and 443.5MB in the end (delta: 132.1MB). Free memory was 233.8MB in the beginning and 293.4MB in the end (delta: -59.6MB). Peak memory consumption was 110.3MB. Max. memory is 8.0GB. [2022-10-16 13:28:04,534 INFO L158 Benchmark]: TraceAbstraction took 47905.29ms. Allocated memory was 443.5MB in the beginning and 673.2MB in the end (delta: 229.6MB). Free memory was 292.9MB in the beginning and 237.5MB in the end (delta: 55.4MB). Peak memory consumption was 285.1MB. Max. memory is 8.0GB. [2022-10-16 13:28:04,537 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 157.3MB. Free memory was 127.6MB in the beginning and 127.5MB in the end (delta: 80.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 3225.27ms. Allocated memory was 157.3MB in the beginning and 206.6MB in the end (delta: 49.3MB). Free memory was 120.3MB in the beginning and 132.1MB in the end (delta: -11.9MB). Peak memory consumption was 112.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 333.19ms. Allocated memory is still 206.6MB. Free memory was 132.1MB in the beginning and 108.0MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 445.43ms. Allocated memory was 206.6MB in the beginning and 311.4MB in the end (delta: 104.9MB). Free memory was 108.0MB in the beginning and 233.8MB in the end (delta: -125.8MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. * RCFGBuilder took 8938.47ms. Allocated memory was 311.4MB in the beginning and 443.5MB in the end (delta: 132.1MB). Free memory was 233.8MB in the beginning and 293.4MB in the end (delta: -59.6MB). Peak memory consumption was 110.3MB. Max. memory is 8.0GB. * TraceAbstraction took 47905.29ms. Allocated memory was 443.5MB in the beginning and 673.2MB in the end (delta: 229.6MB). Free memory was 292.9MB in the beginning and 237.5MB in the end (delta: 55.4MB). Peak memory consumption was 285.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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: 8133]: integer overflow possible integer overflow possible We found a FailurePath: [L5576] int LDV_IN_INTERRUPT = 1; [L5577] int ldv_state_variable_2 ; [L5578] int ref_cnt ; [L5579] struct Qdisc *cbq_class_ops_group0 ; [L5580] int ldv_state_variable_1 ; [L5581] struct Qdisc *cbq_qdisc_ops_group0 ; [L5582] struct sk_buff *cbq_qdisc_ops_group1 ; [L5583] int ldv_state_variable_0 ; [L7536-L7544] static struct nla_policy const cbq_policy[8U] = { {(unsigned short)0, (unsigned short)0}, {(unsigned short)0, 20U}, {(unsigned short)0, 12U}, {(unsigned short)0, 12U}, {(unsigned short)0, 8U}, {(unsigned short)0, 12U}, {11U, 1024U}, {(unsigned short)0, 4U}}; [L8589-L8592] static struct Qdisc_class_ops const cbq_class_ops = {0, & cbq_graft, & cbq_leaf, & cbq_qlen_notify, & cbq_get, & cbq_put, & cbq_change_class, & cbq_delete, & cbq_walk, & cbq_find_tcf, & cbq_bind_filter, & cbq_unbind_filter, & cbq_dump_class, & cbq_dump_class_stats}; [L8593-L8597] static struct Qdisc_ops cbq_qdisc_ops = {(struct Qdisc_ops *)0, & cbq_class_ops, {'c', 'b', 'q', '\000'}, 896, & cbq_enqueue, & cbq_dequeue, & qdisc_peek_dequeued, & cbq_drop, & cbq_init, & cbq_reset, & cbq_destroy, (int (*)(struct Qdisc * , struct nlattr * ))0, 0, & cbq_dump, & cbq_dump_stats, & __this_module}; [L8613] int ldv_retval_0 ; [L8614] int ldv_retval_1 ; [L9254] int ldv_spin = 0; VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0] [L8642] struct nlattr *ldvarg1 ; [L8643] void *tmp ; [L8644] struct gnet_dump *ldvarg0 ; [L8645] void *tmp___0 ; [L8646] struct Qdisc *ldvarg18 ; [L8647] void *tmp___1 ; [L8648] unsigned long ldvarg11 ; [L8649] unsigned long tmp___2 ; [L8650] struct qdisc_walker *ldvarg20 ; [L8651] void *tmp___3 ; [L8652] struct tcmsg *ldvarg7 ; [L8653] void *tmp___4 ; [L8654] unsigned long ldvarg23 ; [L8655] unsigned long tmp___5 ; [L8656] struct nlattr **ldvarg3 ; [L8657] void *tmp___6 ; [L8658] struct gnet_dump *ldvarg12 ; [L8659] void *tmp___7 ; [L8660] struct sk_buff *ldvarg8 ; [L8661] void *tmp___8 ; [L8662] unsigned long ldvarg13 ; [L8663] unsigned long tmp___9 ; [L8664] u32 ldvarg10 ; [L8665] u32 tmp___10 ; [L8666] unsigned long ldvarg9 ; [L8667] unsigned long tmp___11 ; [L8668] u32 ldvarg5 ; [L8669] u32 tmp___12 ; [L8670] unsigned long *ldvarg6 ; [L8671] void *tmp___13 ; [L8672] unsigned long ldvarg15 ; [L8673] unsigned long tmp___14 ; [L8674] unsigned long ldvarg16 ; [L8675] unsigned long tmp___15 ; [L8676] unsigned long ldvarg21 ; [L8677] unsigned long tmp___16 ; [L8678] u32 ldvarg4 ; [L8679] u32 tmp___17 ; [L8680] unsigned long ldvarg14 ; [L8681] unsigned long tmp___18 ; [L8682] struct Qdisc **ldvarg17 ; [L8683] void *tmp___19 ; [L8684] u32 ldvarg22 ; [L8685] u32 tmp___20 ; [L8686] unsigned long ldvarg19 ; [L8687] unsigned long tmp___21 ; [L8688] unsigned long ldvarg2 ; [L8689] unsigned long tmp___22 ; [L8690] int tmp___23 ; [L8691] int tmp___24 ; [L8692] int tmp___25 ; [L8693] int tmp___26 ; VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0] [L8695] CALL, EXPR ldv_zalloc(4UL) VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0] [L5518] void *p ; [L5519] void *tmp ; [L5520] int tmp___0 ; [L5522] tmp___0 = __VERIFIER_nondet_int() [L5523] COND TRUE tmp___0 != 0 [L5524] return ((void *)0); VAL [\old(size)=4, \result={0:0}, __this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, size=4, tmp___0=1] [L8695] RET, EXPR ldv_zalloc(4UL) VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_zalloc(4UL)={0:0}, ref_cnt=0] [L8695] tmp = ldv_zalloc(4UL) [L8696] ldvarg1 = (struct nlattr *)tmp VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg1={0:0}, ref_cnt=0, tmp={0:0}] [L8697] CALL, EXPR ldv_zalloc(88UL) VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0] [L5518] void *p ; [L5519] void *tmp ; [L5520] int tmp___0 ; [L5522] tmp___0 = __VERIFIER_nondet_int() [L5523] COND TRUE tmp___0 != 0 [L5524] return ((void *)0); VAL [\old(size)=88, \result={0:0}, __this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, size=88, tmp___0=1] [L8697] RET, EXPR ldv_zalloc(88UL) VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_zalloc(88UL)={0:0}, ldvarg1={0:0}, ref_cnt=0, tmp={0:0}] [L8697] tmp___0 = ldv_zalloc(88UL) [L8698] ldvarg0 = (struct gnet_dump *)tmp___0 VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={0:0}, ldvarg1={0:0}, ref_cnt=0, tmp={0:0}, tmp___0={0:0}] [L8699] CALL, EXPR ldv_zalloc(448UL) VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0] [L5518] void *p ; [L5519] void *tmp ; [L5520] int tmp___0 ; [L5522] tmp___0 = __VERIFIER_nondet_int() [L5523] COND TRUE tmp___0 != 0 [L5524] return ((void *)0); VAL [\old(size)=448, \result={0:0}, __this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, size=448, tmp___0=1] [L8699] RET, EXPR ldv_zalloc(448UL) VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_zalloc(448UL)={0:0}, ldvarg0={0:0}, ldvarg1={0:0}, ref_cnt=0, tmp={0:0}, tmp___0={0:0}] [L8699] tmp___1 = ldv_zalloc(448UL) [L8700] ldvarg18 = (struct Qdisc *)tmp___1 [L8701] tmp___2 = __VERIFIER_nondet_ulong() [L8702] ldvarg11 = tmp___2 VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={0:0}, ldvarg1={0:0}, ldvarg11=6, ldvarg18={0:0}, ref_cnt=0, tmp={0:0}, tmp___0={0:0}, tmp___1={0:0}, tmp___2=6] [L8703] CALL, EXPR ldv_zalloc(24UL) VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0] [L5518] void *p ; [L5519] void *tmp ; [L5520] int tmp___0 ; [L5522] tmp___0 = __VERIFIER_nondet_int() [L5523] COND TRUE tmp___0 != 0 [L5524] return ((void *)0); VAL [\old(size)=24, \result={0:0}, __this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, size=24, tmp___0=1] [L8703] RET, EXPR ldv_zalloc(24UL) VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_zalloc(24UL)={0:0}, ldvarg0={0:0}, ldvarg1={0:0}, ldvarg11=6, ldvarg18={0:0}, ref_cnt=0, tmp={0:0}, tmp___0={0:0}, tmp___1={0:0}, tmp___2=6] [L8703] tmp___3 = ldv_zalloc(24UL) [L8704] ldvarg20 = (struct qdisc_walker *)tmp___3 VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={0:0}, ldvarg1={0:0}, ldvarg11=6, ldvarg18={0:0}, ldvarg20={0:0}, ref_cnt=0, tmp={0:0}, tmp___0={0:0}, tmp___1={0:0}, tmp___2=6, tmp___3={0:0}] [L8705] CALL, EXPR ldv_zalloc(20UL) VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0] [L5518] void *p ; [L5519] void *tmp ; [L5520] int tmp___0 ; [L5522] tmp___0 = __VERIFIER_nondet_int() [L5523] COND TRUE tmp___0 != 0 [L5524] return ((void *)0); VAL [\old(size)=20, \result={0:0}, __this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, size=20, tmp___0=1] [L8705] RET, EXPR ldv_zalloc(20UL) VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_zalloc(20UL)={0:0}, ldvarg0={0:0}, ldvarg1={0:0}, ldvarg11=6, ldvarg18={0:0}, ldvarg20={0:0}, ref_cnt=0, tmp={0:0}, tmp___0={0:0}, tmp___1={0:0}, tmp___2=6, tmp___3={0:0}] [L8705] tmp___4 = ldv_zalloc(20UL) [L8706] ldvarg7 = (struct tcmsg *)tmp___4 [L8707] tmp___5 = __VERIFIER_nondet_ulong() [L8708] ldvarg23 = tmp___5 VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={0:0}, ldvarg1={0:0}, ldvarg11=6, ldvarg18={0:0}, ldvarg20={0:0}, ldvarg23=12, ldvarg7={0:0}, ref_cnt=0, tmp={0:0}, tmp___0={0:0}, tmp___1={0:0}, tmp___2=6, tmp___3={0:0}, tmp___4={0:0}, tmp___5=12] [L8709] CALL, EXPR ldv_zalloc(8UL) VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0] [L5518] void *p ; [L5519] void *tmp ; [L5520] int tmp___0 ; [L5522] tmp___0 = __VERIFIER_nondet_int() [L5523] COND TRUE tmp___0 != 0 [L5524] return ((void *)0); VAL [\old(size)=8, \result={0:0}, __this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, size=8, tmp___0=1] [L8709] RET, EXPR ldv_zalloc(8UL) VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_zalloc(8UL)={0:0}, ldvarg0={0:0}, ldvarg1={0:0}, ldvarg11=6, ldvarg18={0:0}, ldvarg20={0:0}, ldvarg23=12, ldvarg7={0:0}, ref_cnt=0, tmp={0:0}, tmp___0={0:0}, tmp___1={0:0}, tmp___2=6, tmp___3={0:0}, tmp___4={0:0}, tmp___5=12] [L8709] tmp___6 = ldv_zalloc(8UL) [L8710] ldvarg3 = (struct nlattr **)tmp___6 VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={0:0}, ldvarg1={0:0}, ldvarg11=6, ldvarg18={0:0}, ldvarg20={0:0}, ldvarg23=12, ldvarg3={0:0}, ldvarg7={0:0}, ref_cnt=0, tmp={0:0}, tmp___0={0:0}, tmp___1={0:0}, tmp___2=6, tmp___3={0:0}, tmp___4={0:0}, tmp___5=12, tmp___6={0:0}] [L8711] CALL, EXPR ldv_zalloc(88UL) VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0] [L5518] void *p ; [L5519] void *tmp ; [L5520] int tmp___0 ; [L5522] tmp___0 = __VERIFIER_nondet_int() [L5523] COND TRUE tmp___0 != 0 [L5524] return ((void *)0); VAL [\old(size)=88, \result={0:0}, __this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, size=88, tmp___0=1] [L8711] RET, EXPR ldv_zalloc(88UL) VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_zalloc(88UL)={0:0}, ldvarg0={0:0}, ldvarg1={0:0}, ldvarg11=6, ldvarg18={0:0}, ldvarg20={0:0}, ldvarg23=12, ldvarg3={0:0}, ldvarg7={0:0}, ref_cnt=0, tmp={0:0}, tmp___0={0:0}, tmp___1={0:0}, tmp___2=6, tmp___3={0:0}, tmp___4={0:0}, tmp___5=12, tmp___6={0:0}] [L8711] tmp___7 = ldv_zalloc(88UL) [L8712] ldvarg12 = (struct gnet_dump *)tmp___7 VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={0:0}, ldvarg1={0:0}, ldvarg11=6, ldvarg12={0:0}, ldvarg18={0:0}, ldvarg20={0:0}, ldvarg23=12, ldvarg3={0:0}, ldvarg7={0:0}, ref_cnt=0, tmp={0:0}, tmp___0={0:0}, tmp___1={0:0}, tmp___2=6, tmp___3={0:0}, tmp___4={0:0}, tmp___5=12, tmp___6={0:0}, tmp___7={0:0}] [L8713] CALL, EXPR ldv_zalloc(232UL) VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0] [L5518] void *p ; [L5519] void *tmp ; [L5520] int tmp___0 ; [L5522] tmp___0 = __VERIFIER_nondet_int() [L5523] COND TRUE tmp___0 != 0 [L5524] return ((void *)0); VAL [\old(size)=232, \result={0:0}, __this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, size=232, tmp___0=1] [L8713] RET, EXPR ldv_zalloc(232UL) VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_zalloc(232UL)={0:0}, ldvarg0={0:0}, ldvarg1={0:0}, ldvarg11=6, ldvarg12={0:0}, ldvarg18={0:0}, ldvarg20={0:0}, ldvarg23=12, ldvarg3={0:0}, ldvarg7={0:0}, ref_cnt=0, tmp={0:0}, tmp___0={0:0}, tmp___1={0:0}, tmp___2=6, tmp___3={0:0}, tmp___4={0:0}, tmp___5=12, tmp___6={0:0}, tmp___7={0:0}] [L8713] tmp___8 = ldv_zalloc(232UL) [L8714] ldvarg8 = (struct sk_buff *)tmp___8 [L8715] tmp___9 = __VERIFIER_nondet_ulong() [L8716] ldvarg13 = tmp___9 [L8717] tmp___10 = __VERIFIER_nondet_u32() [L8718] ldvarg10 = tmp___10 [L8719] tmp___11 = __VERIFIER_nondet_ulong() [L8720] ldvarg9 = tmp___11 [L8721] tmp___12 = __VERIFIER_nondet_u32() [L8722] ldvarg5 = tmp___12 VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={0:0}, ldvarg1={0:0}, ldvarg10=5, ldvarg11=6, ldvarg12={0:0}, ldvarg13=3, ldvarg18={0:0}, ldvarg20={0:0}, ldvarg23=12, ldvarg3={0:0}, ldvarg5=7, ldvarg7={0:0}, ldvarg8={0:0}, ldvarg9=2, ref_cnt=0, tmp={0:0}, tmp___0={0:0}, tmp___1={0:0}, tmp___10=5, tmp___11=2, tmp___12=7, tmp___2=6, tmp___3={0:0}, tmp___4={0:0}, tmp___5=12, tmp___6={0:0}, tmp___7={0:0}, tmp___8={0:0}, tmp___9=3] [L8723] CALL, EXPR ldv_zalloc(8UL) VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0] [L5518] void *p ; [L5519] void *tmp ; [L5520] int tmp___0 ; [L5522] tmp___0 = __VERIFIER_nondet_int() [L5523] COND TRUE tmp___0 != 0 [L5524] return ((void *)0); VAL [\old(size)=8, \result={0:0}, __this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, size=8, tmp___0=1] [L8723] RET, EXPR ldv_zalloc(8UL) VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_zalloc(8UL)={0:0}, ldvarg0={0:0}, ldvarg1={0:0}, ldvarg10=5, ldvarg11=6, ldvarg12={0:0}, ldvarg13=3, ldvarg18={0:0}, ldvarg20={0:0}, ldvarg23=12, ldvarg3={0:0}, ldvarg5=7, ldvarg7={0:0}, ldvarg8={0:0}, ldvarg9=2, ref_cnt=0, tmp={0:0}, tmp___0={0:0}, tmp___1={0:0}, tmp___10=5, tmp___11=2, tmp___12=7, tmp___2=6, tmp___3={0:0}, tmp___4={0:0}, tmp___5=12, tmp___6={0:0}, tmp___7={0:0}, tmp___8={0:0}, tmp___9=3] [L8723] tmp___13 = ldv_zalloc(8UL) [L8724] ldvarg6 = (unsigned long *)tmp___13 [L8725] tmp___14 = __VERIFIER_nondet_ulong() [L8726] ldvarg15 = tmp___14 [L8727] tmp___15 = __VERIFIER_nondet_ulong() [L8728] ldvarg16 = tmp___15 [L8729] tmp___16 = __VERIFIER_nondet_ulong() [L8730] ldvarg21 = tmp___16 [L8731] tmp___17 = __VERIFIER_nondet_u32() [L8732] ldvarg4 = tmp___17 [L8733] tmp___18 = __VERIFIER_nondet_ulong() [L8734] ldvarg14 = tmp___18 VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={0:0}, ldvarg1={0:0}, ldvarg10=5, ldvarg11=6, ldvarg12={0:0}, ldvarg13=3, ldvarg14=4294967294, ldvarg15=13, ldvarg16=4294967295, ldvarg18={0:0}, ldvarg20={0:0}, ldvarg21=4, ldvarg23=12, ldvarg3={0:0}, ldvarg4=10, ldvarg5=7, ldvarg6={0:0}, ldvarg7={0:0}, ldvarg8={0:0}, ldvarg9=2, ref_cnt=0, tmp={0:0}, tmp___0={0:0}, tmp___1={0:0}, tmp___10=5, tmp___11=2, tmp___12=7, tmp___13={0:0}, tmp___14=13, tmp___15=4294967295, tmp___16=4, tmp___17=10, tmp___18=4294967294, tmp___2=6, tmp___3={0:0}, tmp___4={0:0}, tmp___5=12, tmp___6={0:0}, tmp___7={0:0}, tmp___8={0:0}, tmp___9=3] [L8735] CALL, EXPR ldv_zalloc(8UL) VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0] [L5518] void *p ; [L5519] void *tmp ; [L5520] int tmp___0 ; [L5522] tmp___0 = __VERIFIER_nondet_int() [L5523] COND TRUE tmp___0 != 0 [L5524] return ((void *)0); VAL [\old(size)=8, \result={0:0}, __this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, size=8, tmp___0=1] [L8735] RET, EXPR ldv_zalloc(8UL) VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_zalloc(8UL)={0:0}, ldvarg0={0:0}, ldvarg1={0:0}, ldvarg10=5, ldvarg11=6, ldvarg12={0:0}, ldvarg13=3, ldvarg14=4294967294, ldvarg15=13, ldvarg16=4294967295, ldvarg18={0:0}, ldvarg20={0:0}, ldvarg21=4, ldvarg23=12, ldvarg3={0:0}, ldvarg4=10, ldvarg5=7, ldvarg6={0:0}, ldvarg7={0:0}, ldvarg8={0:0}, ldvarg9=2, ref_cnt=0, tmp={0:0}, tmp___0={0:0}, tmp___1={0:0}, tmp___10=5, tmp___11=2, tmp___12=7, tmp___13={0:0}, tmp___14=13, tmp___15=4294967295, tmp___16=4, tmp___17=10, tmp___18=4294967294, tmp___2=6, tmp___3={0:0}, tmp___4={0:0}, tmp___5=12, tmp___6={0:0}, tmp___7={0:0}, tmp___8={0:0}, tmp___9=3] [L8735] tmp___19 = ldv_zalloc(8UL) [L8736] ldvarg17 = (struct Qdisc **)tmp___19 [L8737] tmp___20 = __VERIFIER_nondet_u32() [L8738] ldvarg22 = tmp___20 [L8739] tmp___21 = __VERIFIER_nondet_ulong() [L8740] ldvarg19 = tmp___21 [L8741] tmp___22 = __VERIFIER_nondet_ulong() [L8742] ldvarg2 = tmp___22 [L8743] FCALL ldv_initialize() [L8744] ldv_state_variable_1 = 0 [L8745] ref_cnt = 0 [L8746] ldv_state_variable_0 = 1 [L8747] ldv_state_variable_2 = 0 VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={0:0}, ldvarg1={0:0}, ldvarg10=5, ldvarg11=6, ldvarg12={0:0}, ldvarg13=3, ldvarg14=4294967294, ldvarg15=13, ldvarg16=4294967295, ldvarg17={0:0}, ldvarg18={0:0}, ldvarg19=8, ldvarg2=11, ldvarg20={0:0}, ldvarg21=4, ldvarg22=9, ldvarg23=12, ldvarg3={0:0}, ldvarg4=10, ldvarg5=7, ldvarg6={0:0}, ldvarg7={0:0}, ldvarg8={0:0}, ldvarg9=2, ref_cnt=0, tmp={0:0}, tmp___0={0:0}, tmp___1={0:0}, tmp___10=5, tmp___11=2, tmp___12=7, tmp___13={0:0}, tmp___14=13, tmp___15=4294967295, tmp___16=4, tmp___17=10, tmp___18=4294967294, tmp___19={0:0}, tmp___2=6, tmp___20=9, tmp___21=8, tmp___22=11, tmp___3={0:0}, tmp___4={0:0}, tmp___5=12, tmp___6={0:0}, tmp___7={0:0}, tmp___8={0:0}, tmp___9=3] [L8749] tmp___23 = __VERIFIER_nondet_int() [L8751] case 0: [L8913] case 1: VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={0:0}, ldvarg1={0:0}, ldvarg10=5, ldvarg11=6, ldvarg12={0:0}, ldvarg13=3, ldvarg14=4294967294, ldvarg15=13, ldvarg16=4294967295, ldvarg17={0:0}, ldvarg18={0:0}, ldvarg19=8, ldvarg2=11, ldvarg20={0:0}, ldvarg21=4, ldvarg22=9, ldvarg23=12, ldvarg3={0:0}, ldvarg4=10, ldvarg5=7, ldvarg6={0:0}, ldvarg7={0:0}, ldvarg8={0:0}, ldvarg9=2, ref_cnt=0, tmp={0:0}, tmp___0={0:0}, tmp___1={0:0}, tmp___10=5, tmp___11=2, tmp___12=7, tmp___13={0:0}, tmp___14=13, tmp___15=4294967295, tmp___16=4, tmp___17=10, tmp___18=4294967294, tmp___19={0:0}, tmp___2=6, tmp___20=9, tmp___21=8, tmp___22=11, tmp___23=1, tmp___3={0:0}, tmp___4={0:0}, tmp___5=12, tmp___6={0:0}, tmp___7={0:0}, tmp___8={0:0}, tmp___9=3] [L8914] COND TRUE ldv_state_variable_0 != 0 [L8915] tmp___25 = __VERIFIER_nondet_int() [L8917] case 0: [L8925] case 1: VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={0:0}, ldvarg1={0:0}, ldvarg10=5, ldvarg11=6, ldvarg12={0:0}, ldvarg13=3, ldvarg14=4294967294, ldvarg15=13, ldvarg16=4294967295, ldvarg17={0:0}, ldvarg18={0:0}, ldvarg19=8, ldvarg2=11, ldvarg20={0:0}, ldvarg21=4, ldvarg22=9, ldvarg23=12, ldvarg3={0:0}, ldvarg4=10, ldvarg5=7, ldvarg6={0:0}, ldvarg7={0:0}, ldvarg8={0:0}, ldvarg9=2, ref_cnt=0, tmp={0:0}, tmp___0={0:0}, tmp___1={0:0}, tmp___10=5, tmp___11=2, tmp___12=7, tmp___13={0:0}, tmp___14=13, tmp___15=4294967295, tmp___16=4, tmp___17=10, tmp___18=4294967294, tmp___19={0:0}, tmp___2=6, tmp___20=9, tmp___21=8, tmp___22=11, tmp___23=1, tmp___25=1, tmp___3={0:0}, tmp___4={0:0}, tmp___5=12, tmp___6={0:0}, tmp___7={0:0}, tmp___8={0:0}, tmp___9=3] [L8926] COND TRUE ldv_state_variable_0 == 1 [L8927] CALL, EXPR cbq_module_init() [L8600] int tmp ; [L8602] CALL, EXPR register_qdisc(& cbq_qdisc_ops) [L9484] return __VERIFIER_nondet_int(); [L8602] RET, EXPR register_qdisc(& cbq_qdisc_ops) [L8602] tmp = register_qdisc(& cbq_qdisc_ops) [L8603] return (tmp); VAL [\result=0, __this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, tmp=0] [L8927] RET, EXPR cbq_module_init() [L8927] ldv_retval_1 = cbq_module_init() [L8928] COND TRUE ldv_retval_1 == 0 [L8929] ldv_state_variable_0 = 3 [L8930] ldv_state_variable_2 = 1 [L8931] CALL ldv_initialize_Qdisc_class_ops_2() [L8633] void *tmp ; VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=3, ldv_state_variable_1=0, ldv_state_variable_2=1, ref_cnt=0] [L8635] CALL, EXPR ldv_zalloc(448UL) VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=3, ldv_state_variable_1=0, ldv_state_variable_2=1, ref_cnt=0] [L5518] void *p ; [L5519] void *tmp ; [L5520] int tmp___0 ; [L5522] tmp___0 = __VERIFIER_nondet_int() [L5523] COND TRUE tmp___0 != 0 [L5524] return ((void *)0); VAL [\old(size)=448, \result={0:0}, __this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=3, ldv_state_variable_1=0, ldv_state_variable_2=1, ref_cnt=0, size=448, tmp___0=1] [L8635] RET, EXPR ldv_zalloc(448UL) VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=3, ldv_state_variable_1=0, ldv_state_variable_2=1, ldv_zalloc(448UL)={0:0}, ref_cnt=0] [L8635] tmp = ldv_zalloc(448UL) [L8636] cbq_class_ops_group0 = (struct Qdisc *)tmp VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=3, ldv_state_variable_1=0, ldv_state_variable_2=1, ref_cnt=0, tmp={0:0}] [L8931] RET ldv_initialize_Qdisc_class_ops_2() [L8932] ldv_state_variable_1 = 1 [L8933] CALL ldv_initialize_Qdisc_ops_1() [L8621] void *tmp ; [L8622] void *tmp___0 ; VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ref_cnt=0] [L8624] CALL, EXPR ldv_zalloc(448UL) VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ref_cnt=0] [L5518] void *p ; [L5519] void *tmp ; [L5520] int tmp___0 ; [L5522] tmp___0 = __VERIFIER_nondet_int() [L5523] COND TRUE tmp___0 != 0 [L5524] return ((void *)0); VAL [\old(size)=448, \result={0:0}, __this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ref_cnt=0, size=448, tmp___0=1] [L8624] RET, EXPR ldv_zalloc(448UL) VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_zalloc(448UL)={0:0}, ref_cnt=0] [L8624] tmp = ldv_zalloc(448UL) [L8625] cbq_qdisc_ops_group0 = (struct Qdisc *)tmp VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ref_cnt=0, tmp={0:0}] [L8626] CALL, EXPR ldv_zalloc(232UL) VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ref_cnt=0] [L5518] void *p ; [L5519] void *tmp ; [L5520] int tmp___0 ; [L5522] tmp___0 = __VERIFIER_nondet_int() [L5523] COND TRUE tmp___0 != 0 [L5524] return ((void *)0); VAL [\old(size)=232, \result={0:0}, __this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ref_cnt=0, size=232, tmp___0=1] [L8626] RET, EXPR ldv_zalloc(232UL) VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_zalloc(232UL)={0:0}, ref_cnt=0, tmp={0:0}] [L8626] tmp___0 = ldv_zalloc(232UL) [L8627] cbq_qdisc_ops_group1 = (struct sk_buff *)tmp___0 VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ref_cnt=0, tmp={0:0}, tmp___0={0:0}] [L8933] RET ldv_initialize_Qdisc_ops_1() [L8936] COND FALSE !(ldv_retval_1 != 0) VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldvarg0={0:0}, ldvarg1={0:0}, ldvarg10=5, ldvarg11=6, ldvarg12={0:0}, ldvarg13=3, ldvarg14=4294967294, ldvarg15=13, ldvarg16=4294967295, ldvarg17={0:0}, ldvarg18={0:0}, ldvarg19=8, ldvarg2=11, ldvarg20={0:0}, ldvarg21=4, ldvarg22=9, ldvarg23=12, ldvarg3={0:0}, ldvarg4=10, ldvarg5=7, ldvarg6={0:0}, ldvarg7={0:0}, ldvarg8={0:0}, ldvarg9=2, ref_cnt=0, tmp={0:0}, tmp___0={0:0}, tmp___1={0:0}, tmp___10=5, tmp___11=2, tmp___12=7, tmp___13={0:0}, tmp___14=13, tmp___15=4294967295, tmp___16=4, tmp___17=10, tmp___18=4294967294, tmp___19={0:0}, tmp___2=6, tmp___20=9, tmp___21=8, tmp___22=11, tmp___23=1, tmp___25=1, tmp___3={0:0}, tmp___4={0:0}, tmp___5=12, tmp___6={0:0}, tmp___7={0:0}, tmp___8={0:0}, tmp___9=3] [L8749] tmp___23 = __VERIFIER_nondet_int() [L8751] case 0: [L8913] case 1: [L8951] case 2: VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldvarg0={0:0}, ldvarg1={0:0}, ldvarg10=5, ldvarg11=6, ldvarg12={0:0}, ldvarg13=3, ldvarg14=4294967294, ldvarg15=13, ldvarg16=4294967295, ldvarg17={0:0}, ldvarg18={0:0}, ldvarg19=8, ldvarg2=11, ldvarg20={0:0}, ldvarg21=4, ldvarg22=9, ldvarg23=12, ldvarg3={0:0}, ldvarg4=10, ldvarg5=7, ldvarg6={0:0}, ldvarg7={0:0}, ldvarg8={0:0}, ldvarg9=2, ref_cnt=0, tmp={0:0}, tmp___0={0:0}, tmp___1={0:0}, tmp___10=5, tmp___11=2, tmp___12=7, tmp___13={0:0}, tmp___14=13, tmp___15=4294967295, tmp___16=4, tmp___17=10, tmp___18=4294967294, tmp___19={0:0}, tmp___2=6, tmp___20=9, tmp___21=8, tmp___22=11, tmp___23=2, tmp___25=1, tmp___3={0:0}, tmp___4={0:0}, tmp___5=12, tmp___6={0:0}, tmp___7={0:0}, tmp___8={0:0}, tmp___9=3] [L8952] COND TRUE ldv_state_variable_2 != 0 [L8953] tmp___26 = __VERIFIER_nondet_int() [L8955] case 0: [L8967] case 1: [L8979] case 2: [L8991] case 3: [L9003] case 4: [L9015] case 5: [L9023] case 6: [L9035] case 7: VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldvarg0={0:0}, ldvarg1={0:0}, ldvarg10=5, ldvarg11=6, ldvarg12={0:0}, ldvarg13=3, ldvarg14=4294967294, ldvarg15=13, ldvarg16=4294967295, ldvarg17={0:0}, ldvarg18={0:0}, ldvarg19=8, ldvarg2=11, ldvarg20={0:0}, ldvarg21=4, ldvarg22=9, ldvarg23=12, ldvarg3={0:0}, ldvarg4=10, ldvarg5=7, ldvarg6={0:0}, ldvarg7={0:0}, ldvarg8={0:0}, ldvarg9=2, ref_cnt=0, tmp={0:0}, tmp___0={0:0}, tmp___1={0:0}, tmp___10=5, tmp___11=2, tmp___12=7, tmp___13={0:0}, tmp___14=13, tmp___15=4294967295, tmp___16=4, tmp___17=10, tmp___18=4294967294, tmp___19={0:0}, tmp___2=6, tmp___20=9, tmp___21=8, tmp___22=11, tmp___23=2, tmp___25=1, tmp___26=7, tmp___3={0:0}, tmp___4={0:0}, tmp___5=12, tmp___6={0:0}, tmp___7={0:0}, tmp___8={0:0}, tmp___9=3] [L9036] COND TRUE ldv_state_variable_2 == 1 VAL [__this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldvarg0={0:0}, ldvarg1={0:0}, ldvarg10=5, ldvarg11=6, ldvarg12={0:0}, ldvarg13=3, ldvarg14=4294967294, ldvarg15=13, ldvarg16=4294967295, ldvarg17={0:0}, ldvarg18={0:0}, ldvarg19=8, ldvarg2=11, ldvarg20={0:0}, ldvarg21=4, ldvarg22=9, ldvarg23=12, ldvarg3={0:0}, ldvarg4=10, ldvarg5=7, ldvarg6={0:0}, ldvarg7={0:0}, ldvarg8={0:0}, ldvarg9=2, ref_cnt=0, tmp={0:0}, tmp___0={0:0}, tmp___1={0:0}, tmp___10=5, tmp___11=2, tmp___12=7, tmp___13={0:0}, tmp___14=13, tmp___15=4294967295, tmp___16=4, tmp___17=10, tmp___18=4294967294, tmp___19={0:0}, tmp___2=6, tmp___20=9, tmp___21=8, tmp___22=11, tmp___23=2, tmp___25=1, tmp___26=7, tmp___3={0:0}, tmp___4={0:0}, tmp___5=12, tmp___6={0:0}, tmp___7={0:0}, tmp___8={0:0}, tmp___9=3] [L9037] CALL cbq_put(cbq_class_ops_group0, ldvarg14) VAL [\old(arg)=4294967294, \old(ldv_spin)=0, __this_module={4294967297:4294967296}, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ref_cnt=0, sch={0:0}] [L8126] struct cbq_class *cl ; [L8127] spinlock_t *root_lock ; [L8128] spinlock_t *tmp ; [L8129] struct cbq_sched_data *q ; [L8130] void *tmp___0 ; [L8132] cl = (struct cbq_class *)arg [L8133] EXPR cl->refcnt VAL [\old(arg)=4294967294, \old(ldv_spin)=0, __this_module={4294967297:4294967296}, arg=4294967294, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, cl={0:-2}, cl->refcnt=2147483649, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ref_cnt=0, sch={0:0}, sch={0:0}] [L8133] cl->refcnt - 1 VAL [\old(arg)=4294967294, \old(ldv_spin)=0, __this_module={4294967297:4294967296}, arg=4294967294, cbq_class_ops={12:0}, cbq_class_ops_group0={0:0}, cbq_policy={11:0}, cbq_qdisc_ops={13:0}, cbq_qdisc_ops_group0={0:0}, cbq_qdisc_ops_group1={0:0}, cl={0:-2}, cl->refcnt=2147483649, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_spin=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ref_cnt=0, sch={0:0}, sch={0:0}] - UnprovableResult [Line: 7356]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7356]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7995]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7995]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5704]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5704]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6334]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6334]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6336]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6336]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6336]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6336]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6336]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6336]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7493]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7493]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7493]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7493]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7027]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7027]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7027]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7027]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7027]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7027]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7604]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7604]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8459]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8459]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7318]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7318]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7439]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7439]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7421]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7421]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8555]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8555]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8565]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8565]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6487]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6487]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6435]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6435]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6437]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6437]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6437]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6437]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6437]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6437]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6446]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6446]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6450]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6450]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6454]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6454]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5626]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5626]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6804]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6804]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6814]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6814]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6827]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6827]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6839]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6839]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7448]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7448]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6581]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6581]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6584]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6584]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5470]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5470]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5470]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5470]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6598]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6598]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6598]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6598]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8311]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8311]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6223]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6223]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6888]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6888]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6197]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6197]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5741]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5741]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7093]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7093]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7097]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7097]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7124]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7124]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7149]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7149]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8505]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8505]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6700]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6700]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6701]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6701]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6701]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6701]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6709]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6709]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6709]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6709]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6709]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6709]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6711]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6711]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6713]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6713]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6921]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6921]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6034]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6034]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8759]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8759]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8765]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8765]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8902]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8902]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8517]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8517]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 9019]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 9019]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 9111]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 9111]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 88 procedures, 1804 locations, 132 error locations. Started 1 CEGAR loops. OverallTime: 47.6s, OverallIterations: 5, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 43.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 16059 SdHoareTripleChecker+Valid, 40.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15221 mSDsluCounter, 25528 SdHoareTripleChecker+Invalid, 35.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14522 mSDsCounter, 4005 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12642 IncrementalHoareTripleChecker+Invalid, 16651 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4005 mSolverCounterUnsat, 11006 mSDtfsCounter, 12642 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 121 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9811occurred in iteration=4, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 4 MinimizatonAttempts, 4177 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 483 NumberOfCodeBlocks, 483 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 368 ConstructedInterpolants, 0 QuantifiedInterpolants, 925 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 989/989 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-10-16 13:28:04,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...