/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/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_fr.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 13:12:51,328 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 13:12:51,331 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 13:12:51,367 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 13:12:51,368 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 13:12:51,369 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 13:12:51,371 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 13:12:51,385 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 13:12:51,388 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 13:12:51,390 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 13:12:51,392 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 13:12:51,396 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 13:12:51,397 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 13:12:51,403 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 13:12:51,405 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 13:12:51,410 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 13:12:51,413 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 13:12:51,416 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 13:12:51,418 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 13:12:51,421 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 13:12:51,423 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 13:12:51,425 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 13:12:51,426 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 13:12:51,427 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 13:12:51,432 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 13:12:51,432 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 13:12:51,433 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 13:12:51,434 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 13:12:51,435 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 13:12:51,436 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 13:12:51,437 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 13:12:51,438 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 13:12:51,439 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 13:12:51,440 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 13:12:51,441 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 13:12:51,441 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 13:12:51,442 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 13:12:51,443 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 13:12:51,443 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 13:12:51,444 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 13:12:51,445 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 13:12:51,446 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:12:51,478 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 13:12:51,478 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 13:12:51,479 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 13:12:51,479 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 13:12:51,480 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 13:12:51,480 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 13:12:51,481 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 13:12:51,481 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 13:12:51,481 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 13:12:51,482 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 13:12:51,482 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 13:12:51,482 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 13:12:51,482 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 13:12:51,483 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 13:12:51,483 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 13:12:51,483 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 13:12:51,483 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 13:12:51,484 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 13:12:51,484 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 13:12:51,484 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 13:12:51,484 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 13:12:51,484 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 13:12:51,485 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 13:12:51,485 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 13:12:51,485 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 13:12:51,485 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 13:12:51,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 13:12:51,486 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 13:12:51,486 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 13:12:51,486 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 13:12:51,487 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 13:12:51,487 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 13:12:51,487 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 13:12:51,487 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:12:51,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 13:12:51,955 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 13:12:51,960 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 13:12:51,963 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 13:12:51,964 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 13:12:51,966 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_fr.ko-entry_point.cil.out.i [2022-10-16 13:12:52,042 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56ea80b99/a73c4e51659d4932b031e71ad831bd2e/FLAG6b76b762b [2022-10-16 13:12:53,119 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 13:12:53,121 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_fr.ko-entry_point.cil.out.i [2022-10-16 13:12:53,194 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56ea80b99/a73c4e51659d4932b031e71ad831bd2e/FLAG6b76b762b [2022-10-16 13:12:53,503 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56ea80b99/a73c4e51659d4932b031e71ad831bd2e [2022-10-16 13:12:53,508 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 13:12:53,515 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 13:12:53,519 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 13:12:53,520 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 13:12:53,525 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 13:12:53,527 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:12:53" (1/1) ... [2022-10-16 13:12:53,529 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@587d1260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:12:53, skipping insertion in model container [2022-10-16 13:12:53,529 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:12:53" (1/1) ... [2022-10-16 13:12:53,540 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 13:12:53,701 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 13:12:54,662 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_fr.ko-entry_point.cil.out.i[154748,154761] [2022-10-16 13:12:55,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 13:12:55,289 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 13:12:55,494 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_fr.ko-entry_point.cil.out.i[154748,154761] [2022-10-16 13:12:55,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 13:12:55,996 INFO L208 MainTranslator]: Completed translation [2022-10-16 13:12:55,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:12:55 WrapperNode [2022-10-16 13:12:55,998 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 13:12:56,002 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 13:12:56,002 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 13:12:56,003 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 13:12:56,012 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:12:55" (1/1) ... [2022-10-16 13:12:56,118 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:12:55" (1/1) ... [2022-10-16 13:12:56,381 INFO L138 Inliner]: procedures = 174, calls = 1111, calls flagged for inlining = 78, calls inlined = 75, statements flattened = 3604 [2022-10-16 13:12:56,382 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 13:12:56,383 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 13:12:56,384 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 13:12:56,384 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 13:12:56,398 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:12:55" (1/1) ... [2022-10-16 13:12:56,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:12:55" (1/1) ... [2022-10-16 13:12:56,437 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:12:55" (1/1) ... [2022-10-16 13:12:56,437 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:12:55" (1/1) ... [2022-10-16 13:12:56,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:12:55" (1/1) ... [2022-10-16 13:12:56,638 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:12:55" (1/1) ... [2022-10-16 13:12:56,671 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:12:55" (1/1) ... [2022-10-16 13:12:56,692 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:12:55" (1/1) ... [2022-10-16 13:12:56,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 13:12:56,722 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 13:12:56,722 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 13:12:56,722 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 13:12:56,723 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:12:55" (1/1) ... [2022-10-16 13:12:56,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 13:12:56,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:12:56,765 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:12:56,784 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:12:56,831 INFO L130 BoogieDeclarations]: Found specification of procedure dlci_to_q922 [2022-10-16 13:12:56,832 INFO L138 BoogieDeclarations]: Found implementation of procedure dlci_to_q922 [2022-10-16 13:12:56,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-10-16 13:12:56,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-10-16 13:12:56,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-10-16 13:12:56,832 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-10-16 13:12:56,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-10-16 13:12:56,833 INFO L130 BoogieDeclarations]: Found specification of procedure dev_queue_xmit [2022-10-16 13:12:56,833 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_queue_xmit [2022-10-16 13:12:56,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 13:12:56,833 INFO L130 BoogieDeclarations]: Found specification of procedure state [2022-10-16 13:12:56,833 INFO L138 BoogieDeclarations]: Found implementation of procedure state [2022-10-16 13:12:56,834 INFO L130 BoogieDeclarations]: Found specification of procedure fr_hard_header [2022-10-16 13:12:56,834 INFO L138 BoogieDeclarations]: Found implementation of procedure fr_hard_header [2022-10-16 13:12:56,834 INFO L130 BoogieDeclarations]: Found specification of procedure find_pvc [2022-10-16 13:12:56,834 INFO L138 BoogieDeclarations]: Found implementation of procedure find_pvc [2022-10-16 13:12:56,834 INFO L130 BoogieDeclarations]: Found specification of procedure dev_to_hdlc [2022-10-16 13:12:56,834 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_to_hdlc [2022-10-16 13:12:56,835 INFO L130 BoogieDeclarations]: Found specification of procedure skb_push [2022-10-16 13:12:56,835 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_push [2022-10-16 13:12:56,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-10-16 13:12:56,835 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-10-16 13:12:56,835 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2022-10-16 13:12:56,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2022-10-16 13:12:56,836 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_off [2022-10-16 13:12:56,836 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_off [2022-10-16 13:12:56,836 INFO L130 BoogieDeclarations]: Found specification of procedure pvc_carrier [2022-10-16 13:12:56,836 INFO L138 BoogieDeclarations]: Found implementation of procedure pvc_carrier [2022-10-16 13:12:56,836 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-10-16 13:12:56,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-10-16 13:12:56,837 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_disconnect_2 [2022-10-16 13:12:56,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_disconnect_2 [2022-10-16 13:12:56,837 INFO L130 BoogieDeclarations]: Found specification of procedure dev_close [2022-10-16 13:12:56,837 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_close [2022-10-16 13:12:56,837 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-10-16 13:12:56,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-10-16 13:12:56,837 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-10-16 13:12:56,838 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-10-16 13:12:56,838 INFO L130 BoogieDeclarations]: Found specification of procedure fr_rx [2022-10-16 13:12:56,838 INFO L138 BoogieDeclarations]: Found implementation of procedure fr_rx [2022-10-16 13:12:56,838 INFO L130 BoogieDeclarations]: Found specification of procedure pvc_ioctl [2022-10-16 13:12:56,838 INFO L138 BoogieDeclarations]: Found implementation of procedure pvc_ioctl [2022-10-16 13:12:56,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 13:12:56,838 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-10-16 13:12:56,838 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-10-16 13:12:56,839 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-10-16 13:12:56,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-10-16 13:12:56,839 INFO L130 BoogieDeclarations]: Found specification of procedure fr_ioctl [2022-10-16 13:12:56,839 INFO L138 BoogieDeclarations]: Found implementation of procedure fr_ioctl [2022-10-16 13:12:56,839 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2022-10-16 13:12:56,839 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2022-10-16 13:12:56,839 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_ok [2022-10-16 13:12:56,840 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_ok [2022-10-16 13:12:56,840 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_on [2022-10-16 13:12:56,840 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_on [2022-10-16 13:12:56,840 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-10-16 13:12:56,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-10-16 13:12:56,840 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_netdev_mqs [2022-10-16 13:12:56,841 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_netdev_mqs [2022-10-16 13:12:56,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-10-16 13:12:56,841 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-10-16 13:12:56,841 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-10-16 13:12:56,841 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-10-16 13:12:56,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-16 13:12:56,841 INFO L130 BoogieDeclarations]: Found specification of procedure hdlc_change_mtu [2022-10-16 13:12:56,842 INFO L138 BoogieDeclarations]: Found implementation of procedure hdlc_change_mtu [2022-10-16 13:12:56,842 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_any [2022-10-16 13:12:56,842 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_any [2022-10-16 13:12:56,842 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2022-10-16 13:12:56,842 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2022-10-16 13:12:56,842 INFO L130 BoogieDeclarations]: Found specification of procedure fr_log_dlci_active [2022-10-16 13:12:56,842 INFO L138 BoogieDeclarations]: Found implementation of procedure fr_log_dlci_active [2022-10-16 13:12:56,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 13:12:56,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 13:12:56,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-16 13:12:56,843 INFO L130 BoogieDeclarations]: Found specification of procedure delete_unused_pvcs [2022-10-16 13:12:56,843 INFO L138 BoogieDeclarations]: Found implementation of procedure delete_unused_pvcs [2022-10-16 13:12:56,843 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2022-10-16 13:12:56,843 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2022-10-16 13:12:56,844 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-10-16 13:12:56,844 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-10-16 13:12:56,925 INFO L130 BoogieDeclarations]: Found specification of procedure pvc_is_used [2022-10-16 13:12:56,925 INFO L138 BoogieDeclarations]: Found implementation of procedure pvc_is_used [2022-10-16 13:12:56,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-16 13:12:56,926 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-10-16 13:12:56,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-10-16 13:12:56,926 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2022-10-16 13:12:56,926 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2022-10-16 13:12:56,926 INFO L130 BoogieDeclarations]: Found specification of procedure fr_set_link_state [2022-10-16 13:12:56,926 INFO L138 BoogieDeclarations]: Found implementation of procedure fr_set_link_state [2022-10-16 13:12:56,926 INFO L130 BoogieDeclarations]: Found specification of procedure fr_lmi_send [2022-10-16 13:12:56,926 INFO L138 BoogieDeclarations]: Found implementation of procedure fr_lmi_send [2022-10-16 13:12:56,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 13:12:56,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-10-16 13:12:56,927 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-10-16 13:12:56,927 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-10-16 13:12:56,927 INFO L130 BoogieDeclarations]: Found specification of procedure capable [2022-10-16 13:12:56,927 INFO L138 BoogieDeclarations]: Found implementation of procedure capable [2022-10-16 13:12:56,928 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-10-16 13:12:56,928 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-10-16 13:12:56,928 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-10-16 13:12:56,928 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-10-16 13:12:56,928 INFO L130 BoogieDeclarations]: Found specification of procedure get_dev_p [2022-10-16 13:12:56,928 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dev_p [2022-10-16 13:12:56,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 13:12:56,928 INFO L130 BoogieDeclarations]: Found specification of procedure linkwatch_fire_event [2022-10-16 13:12:56,929 INFO L138 BoogieDeclarations]: Found implementation of procedure linkwatch_fire_event [2022-10-16 13:12:56,929 INFO L130 BoogieDeclarations]: Found specification of procedure add_pvc [2022-10-16 13:12:56,929 INFO L138 BoogieDeclarations]: Found implementation of procedure add_pvc [2022-10-16 13:12:56,929 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdevice [2022-10-16 13:12:56,929 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdevice [2022-10-16 13:12:56,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-10-16 13:12:56,929 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-10-16 13:12:56,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-10-16 13:12:56,930 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-10-16 13:12:56,930 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-10-16 13:12:56,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 13:12:56,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 13:12:57,552 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 13:12:57,556 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 13:12:57,760 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-10-16 13:13:00,500 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 13:13:00,519 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 13:13:00,519 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-10-16 13:13:00,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:13:00 BoogieIcfgContainer [2022-10-16 13:13:00,524 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 13:13:00,527 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 13:13:00,527 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 13:13:00,531 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 13:13:00,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:12:53" (1/3) ... [2022-10-16 13:13:00,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@227735ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:13:00, skipping insertion in model container [2022-10-16 13:13:00,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:12:55" (2/3) ... [2022-10-16 13:13:00,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@227735ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:13:00, skipping insertion in model container [2022-10-16 13:13:00,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:13:00" (3/3) ... [2022-10-16 13:13:00,535 INFO L112 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_fr.ko-entry_point.cil.out.i [2022-10-16 13:13:00,558 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 13:13:00,558 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 110 error locations. [2022-10-16 13:13:00,654 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 13:13:00,663 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;@51e20b71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 13:13:00,664 INFO L358 AbstractCegarLoop]: Starting to check reachability of 110 error locations. [2022-10-16 13:13:00,676 INFO L276 IsEmpty]: Start isEmpty. Operand has 1377 states, 951 states have (on average 1.4500525762355416) internal successors, (1379), 1076 states have internal predecessors, (1379), 265 states have call successors, (265), 51 states have call predecessors, (265), 50 states have return successors, (261), 260 states have call predecessors, (261), 261 states have call successors, (261) [2022-10-16 13:13:00,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-10-16 13:13:00,688 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:13:00,689 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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:13:00,690 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [dlci_to_q922Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, dlci_to_q922Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_set_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 107 more)] === [2022-10-16 13:13:00,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:13:00,697 INFO L85 PathProgramCache]: Analyzing trace with hash -922648073, now seen corresponding path program 1 times [2022-10-16 13:13:00,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:13:00,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493305842] [2022-10-16 13:13:00,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:13:00,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:13:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:01,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:13:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:01,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:13:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:01,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:13:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:01,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 13:13:01,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:01,485 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-10-16 13:13:01,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:13:01,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493305842] [2022-10-16 13:13:01,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493305842] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:13:01,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:13:01,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 13:13:01,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770801256] [2022-10-16 13:13:01,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:13:01,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 13:13:01,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:13:01,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 13:13:01,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 13:13:01,545 INFO L87 Difference]: Start difference. First operand has 1377 states, 951 states have (on average 1.4500525762355416) internal successors, (1379), 1076 states have internal predecessors, (1379), 265 states have call successors, (265), 51 states have call predecessors, (265), 50 states have return successors, (261), 260 states have call predecessors, (261), 261 states have call successors, (261) Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-10-16 13:13:03,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-16 13:13:07,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:13:07,856 INFO L93 Difference]: Finished difference Result 4247 states and 6094 transitions. [2022-10-16 13:13:07,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 13:13:07,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 36 [2022-10-16 13:13:07,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:13:07,902 INFO L225 Difference]: With dead ends: 4247 [2022-10-16 13:13:07,902 INFO L226 Difference]: Without dead ends: 2842 [2022-10-16 13:13:07,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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:13:07,926 INFO L413 NwaCegarLoop]: 2215 mSDtfsCounter, 2260 mSDsluCounter, 2191 mSDsCounter, 0 mSdLazyCounter, 1587 mSolverCounterSat, 710 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2470 SdHoareTripleChecker+Valid, 4406 SdHoareTripleChecker+Invalid, 2297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 710 IncrementalHoareTripleChecker+Valid, 1587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-10-16 13:13:07,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2470 Valid, 4406 Invalid, 2297 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [710 Valid, 1587 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-10-16 13:13:07,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2842 states. [2022-10-16 13:13:08,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2842 to 2456. [2022-10-16 13:13:08,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2456 states, 1774 states have (on average 1.4222096956031567) internal successors, (2523), 1888 states have internal predecessors, (2523), 492 states have call successors, (492), 96 states have call predecessors, (492), 96 states have return successors, (492), 489 states have call predecessors, (492), 492 states have call successors, (492) [2022-10-16 13:13:08,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2456 states to 2456 states and 3507 transitions. [2022-10-16 13:13:08,300 INFO L78 Accepts]: Start accepts. Automaton has 2456 states and 3507 transitions. Word has length 36 [2022-10-16 13:13:08,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:13:08,303 INFO L495 AbstractCegarLoop]: Abstraction has 2456 states and 3507 transitions. [2022-10-16 13:13:08,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-10-16 13:13:08,304 INFO L276 IsEmpty]: Start isEmpty. Operand 2456 states and 3507 transitions. [2022-10-16 13:13:08,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-10-16 13:13:08,315 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:13:08,315 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:08,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 13:13:08,316 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [dlci_to_q922Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, dlci_to_q922Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_set_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 107 more)] === [2022-10-16 13:13:08,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:13:08,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1198358434, now seen corresponding path program 1 times [2022-10-16 13:13:08,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:13:08,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399656116] [2022-10-16 13:13:08,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:13:08,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:13:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:08,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:13:08,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:08,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:13:08,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:08,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:13:08,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:08,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 13:13:08,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:08,623 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-10-16 13:13:08,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:13:08,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399656116] [2022-10-16 13:13:08,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399656116] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:13:08,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:13:08,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 13:13:08,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605124847] [2022-10-16 13:13:08,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:13:08,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 13:13:08,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:13:08,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 13:13:08,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 13:13:08,628 INFO L87 Difference]: Start difference. First operand 2456 states and 3507 transitions. 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-10-16 13:13:13,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:13:13,567 INFO L93 Difference]: Finished difference Result 6374 states and 9112 transitions. [2022-10-16 13:13:13,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 13:13:13,568 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 46 [2022-10-16 13:13:13,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:13:13,599 INFO L225 Difference]: With dead ends: 6374 [2022-10-16 13:13:13,599 INFO L226 Difference]: Without dead ends: 3930 [2022-10-16 13:13:13,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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:13:13,619 INFO L413 NwaCegarLoop]: 2378 mSDtfsCounter, 1252 mSDsluCounter, 2247 mSDsCounter, 0 mSdLazyCounter, 1568 mSolverCounterSat, 421 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1372 SdHoareTripleChecker+Valid, 4625 SdHoareTripleChecker+Invalid, 1989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 421 IncrementalHoareTripleChecker+Valid, 1568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-10-16 13:13:13,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1372 Valid, 4625 Invalid, 1989 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [421 Valid, 1568 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-10-16 13:13:13,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3930 states. [2022-10-16 13:13:13,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3930 to 3472. [2022-10-16 13:13:13,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3472 states, 2547 states have (on average 1.4216725559481744) internal successors, (3621), 2671 states have internal predecessors, (3621), 682 states have call successors, (682), 149 states have call predecessors, (682), 149 states have return successors, (682), 679 states have call predecessors, (682), 682 states have call successors, (682) [2022-10-16 13:13:13,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3472 states to 3472 states and 4985 transitions. [2022-10-16 13:13:13,855 INFO L78 Accepts]: Start accepts. Automaton has 3472 states and 4985 transitions. Word has length 46 [2022-10-16 13:13:13,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:13:13,855 INFO L495 AbstractCegarLoop]: Abstraction has 3472 states and 4985 transitions. [2022-10-16 13:13:13,856 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-10-16 13:13:13,856 INFO L276 IsEmpty]: Start isEmpty. Operand 3472 states and 4985 transitions. [2022-10-16 13:13:13,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-10-16 13:13:13,859 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:13:13,859 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2022-10-16 13:13:13,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 13:13:13,860 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [dlci_to_q922Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, dlci_to_q922Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_set_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 107 more)] === [2022-10-16 13:13:13,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:13:13,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1739549248, now seen corresponding path program 1 times [2022-10-16 13:13:13,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:13:13,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757442651] [2022-10-16 13:13:13,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:13:13,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:13:13,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:14,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:13:14,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:14,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:13:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:14,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:13:14,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:14,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 13:13:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:14,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-10-16 13:13:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:14,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-16 13:13:14,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:14,120 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-10-16 13:13:14,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:13:14,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757442651] [2022-10-16 13:13:14,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757442651] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:13:14,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:13:14,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 13:13:14,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580495011] [2022-10-16 13:13:14,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:13:14,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 13:13:14,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:13:14,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 13:13:14,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 13:13:14,124 INFO L87 Difference]: Start difference. First operand 3472 states and 4985 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-10-16 13:13:19,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:13:19,880 INFO L93 Difference]: Finished difference Result 9262 states and 13336 transitions. [2022-10-16 13:13:19,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 13:13:19,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 61 [2022-10-16 13:13:19,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:13:19,926 INFO L225 Difference]: With dead ends: 9262 [2022-10-16 13:13:19,927 INFO L226 Difference]: Without dead ends: 5802 [2022-10-16 13:13:19,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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:13:19,951 INFO L413 NwaCegarLoop]: 2407 mSDtfsCounter, 2271 mSDsluCounter, 2267 mSDsCounter, 0 mSdLazyCounter, 1665 mSolverCounterSat, 670 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2479 SdHoareTripleChecker+Valid, 4674 SdHoareTripleChecker+Invalid, 2335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 670 IncrementalHoareTripleChecker+Valid, 1665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-10-16 13:13:19,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2479 Valid, 4674 Invalid, 2335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [670 Valid, 1665 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-10-16 13:13:19,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5802 states. [2022-10-16 13:13:20,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5802 to 5118. [2022-10-16 13:13:20,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5118 states, 3792 states have (on average 1.4193037974683544) internal successors, (5382), 3932 states have internal predecessors, (5382), 1006 states have call successors, (1006), 226 states have call predecessors, (1006), 226 states have return successors, (1006), 1001 states have call predecessors, (1006), 1006 states have call successors, (1006) [2022-10-16 13:13:20,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5118 states to 5118 states and 7394 transitions. [2022-10-16 13:13:20,358 INFO L78 Accepts]: Start accepts. Automaton has 5118 states and 7394 transitions. Word has length 61 [2022-10-16 13:13:20,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:13:20,364 INFO L495 AbstractCegarLoop]: Abstraction has 5118 states and 7394 transitions. [2022-10-16 13:13:20,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-10-16 13:13:20,365 INFO L276 IsEmpty]: Start isEmpty. Operand 5118 states and 7394 transitions. [2022-10-16 13:13:20,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-10-16 13:13:20,370 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:13:20,371 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:20,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 13:13:20,372 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [dlci_to_q922Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, dlci_to_q922Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_set_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 107 more)] === [2022-10-16 13:13:20,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:13:20,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1470864839, now seen corresponding path program 1 times [2022-10-16 13:13:20,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:13:20,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18251716] [2022-10-16 13:13:20,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:13:20,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:13:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:20,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:13:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:20,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:13:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:20,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:13:20,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:20,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 13:13:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:20,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-10-16 13:13:20,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:20,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-16 13:13:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:20,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-16 13:13:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:20,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-16 13:13:20,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:20,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-10-16 13:13:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:20,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-10-16 13:13:20,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:20,762 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-10-16 13:13:20,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:13:20,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18251716] [2022-10-16 13:13:20,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18251716] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:13:20,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:13:20,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 13:13:20,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481561709] [2022-10-16 13:13:20,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:13:20,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 13:13:20,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:13:20,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 13:13:20,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 13:13:20,766 INFO L87 Difference]: Start difference. First operand 5118 states and 7394 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-10-16 13:13:24,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:13:24,907 INFO L93 Difference]: Finished difference Result 6838 states and 10111 transitions. [2022-10-16 13:13:24,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 13:13:24,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 67 [2022-10-16 13:13:24,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:13:24,973 INFO L225 Difference]: With dead ends: 6838 [2022-10-16 13:13:24,974 INFO L226 Difference]: Without dead ends: 6836 [2022-10-16 13:13:24,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 13:13:24,984 INFO L413 NwaCegarLoop]: 2321 mSDtfsCounter, 762 mSDsluCounter, 2512 mSDsCounter, 0 mSdLazyCounter, 1379 mSolverCounterSat, 287 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 4833 SdHoareTripleChecker+Invalid, 1666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 287 IncrementalHoareTripleChecker+Valid, 1379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-10-16 13:13:24,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 4833 Invalid, 1666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [287 Valid, 1379 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-10-16 13:13:24,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6836 states. [2022-10-16 13:13:25,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6836 to 5154. [2022-10-16 13:13:25,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5154 states, 3822 states have (on average 1.4175824175824177) internal successors, (5418), 3962 states have internal predecessors, (5418), 1012 states have call successors, (1012), 226 states have call predecessors, (1012), 226 states have return successors, (1012), 1007 states have call predecessors, (1012), 1012 states have call successors, (1012) [2022-10-16 13:13:25,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5154 states to 5154 states and 7442 transitions. [2022-10-16 13:13:25,452 INFO L78 Accepts]: Start accepts. Automaton has 5154 states and 7442 transitions. Word has length 67 [2022-10-16 13:13:25,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:13:25,453 INFO L495 AbstractCegarLoop]: Abstraction has 5154 states and 7442 transitions. [2022-10-16 13:13:25,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-10-16 13:13:25,454 INFO L276 IsEmpty]: Start isEmpty. Operand 5154 states and 7442 transitions. [2022-10-16 13:13:25,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-10-16 13:13:25,457 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:13:25,458 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2022-10-16 13:13:25,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 13:13:25,458 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [dlci_to_q922Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, dlci_to_q922Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_set_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 107 more)] === [2022-10-16 13:13:25,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:13:25,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1777937337, now seen corresponding path program 1 times [2022-10-16 13:13:25,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:13:25,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799680794] [2022-10-16 13:13:25,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:13:25,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:13:25,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:25,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:13:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:25,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:13:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:25,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:13:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:25,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 13:13:25,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:25,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-10-16 13:13:25,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:25,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-16 13:13:25,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:25,781 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-10-16 13:13:25,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:13:25,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799680794] [2022-10-16 13:13:25,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799680794] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:13:25,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:13:25,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 13:13:25,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178108146] [2022-10-16 13:13:25,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:13:25,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 13:13:25,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:13:25,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 13:13:25,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 13:13:25,788 INFO L87 Difference]: Start difference. First operand 5154 states and 7442 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-10-16 13:13:31,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:13:31,784 INFO L93 Difference]: Finished difference Result 8212 states and 11884 transitions. [2022-10-16 13:13:31,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 13:13:31,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 68 [2022-10-16 13:13:31,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:13:31,852 INFO L225 Difference]: With dead ends: 8212 [2022-10-16 13:13:31,852 INFO L226 Difference]: Without dead ends: 8206 [2022-10-16 13:13:31,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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:13:31,860 INFO L413 NwaCegarLoop]: 2273 mSDtfsCounter, 2287 mSDsluCounter, 2207 mSDsCounter, 0 mSdLazyCounter, 1624 mSolverCounterSat, 693 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2499 SdHoareTripleChecker+Valid, 4480 SdHoareTripleChecker+Invalid, 2317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 693 IncrementalHoareTripleChecker+Valid, 1624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-10-16 13:13:31,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2499 Valid, 4480 Invalid, 2317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [693 Valid, 1624 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-10-16 13:13:31,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8206 states. [2022-10-16 13:13:32,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8206 to 7281. [2022-10-16 13:13:32,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7281 states, 5434 states have (on average 1.4142436510857563) internal successors, (7685), 5595 states have internal predecessors, (7685), 1425 states have call successors, (1425), 328 states have call predecessors, (1425), 328 states have return successors, (1425), 1418 states have call predecessors, (1425), 1425 states have call successors, (1425) [2022-10-16 13:13:32,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7281 states to 7281 states and 10535 transitions. [2022-10-16 13:13:32,482 INFO L78 Accepts]: Start accepts. Automaton has 7281 states and 10535 transitions. Word has length 68 [2022-10-16 13:13:32,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:13:32,483 INFO L495 AbstractCegarLoop]: Abstraction has 7281 states and 10535 transitions. [2022-10-16 13:13:32,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-10-16 13:13:32,483 INFO L276 IsEmpty]: Start isEmpty. Operand 7281 states and 10535 transitions. [2022-10-16 13:13:32,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-10-16 13:13:32,487 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:13:32,487 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:13:32,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 13:13:32,488 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [dlci_to_q922Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, dlci_to_q922Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_set_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 107 more)] === [2022-10-16 13:13:32,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:13:32,489 INFO L85 PathProgramCache]: Analyzing trace with hash 476946365, now seen corresponding path program 1 times [2022-10-16 13:13:32,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:13:32,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925908707] [2022-10-16 13:13:32,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:13:32,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:13:32,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:32,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:13:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:32,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:13:32,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:32,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:13:32,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:32,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 13:13:32,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:32,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-10-16 13:13:32,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:32,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-16 13:13:32,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:32,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-16 13:13:32,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:32,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-16 13:13:32,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:32,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-10-16 13:13:32,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:32,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-10-16 13:13:32,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:32,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-16 13:13:32,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:32,899 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-10-16 13:13:32,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:13:32,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925908707] [2022-10-16 13:13:32,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925908707] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:13:32,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391925270] [2022-10-16 13:13:32,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:13:32,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:13:32,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:13:32,903 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 13:13:32,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-16 13:13:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:33,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 993 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-16 13:13:33,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:13:33,411 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-10-16 13:13:33,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 13:13:33,491 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-10-16 13:13:33,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391925270] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 13:13:33,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 13:13:33,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2022-10-16 13:13:33,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325050663] [2022-10-16 13:13:33,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 13:13:33,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 13:13:33,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:13:33,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 13:13:33,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-10-16 13:13:33,495 INFO L87 Difference]: Start difference. First operand 7281 states and 10535 transitions. Second operand has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 6 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-10-16 13:13:39,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:13:39,857 INFO L93 Difference]: Finished difference Result 14240 states and 21400 transitions. [2022-10-16 13:13:39,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-16 13:13:39,858 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 6 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 76 [2022-10-16 13:13:39,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:13:39,934 INFO L225 Difference]: With dead ends: 14240 [2022-10-16 13:13:39,935 INFO L226 Difference]: Without dead ends: 14239 [2022-10-16 13:13:39,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-10-16 13:13:39,946 INFO L413 NwaCegarLoop]: 2619 mSDtfsCounter, 2415 mSDsluCounter, 6550 mSDsCounter, 0 mSdLazyCounter, 3280 mSolverCounterSat, 479 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2823 SdHoareTripleChecker+Valid, 9169 SdHoareTripleChecker+Invalid, 3759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 479 IncrementalHoareTripleChecker+Valid, 3280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-10-16 13:13:39,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2823 Valid, 9169 Invalid, 3759 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [479 Valid, 3280 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-10-16 13:13:39,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14239 states. [2022-10-16 13:13:40,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14239 to 7434. [2022-10-16 13:13:40,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7434 states, 5560 states have (on average 1.4129496402877697) internal successors, (7856), 5721 states have internal predecessors, (7856), 1452 states have call successors, (1452), 328 states have call predecessors, (1452), 328 states have return successors, (1452), 1445 states have call predecessors, (1452), 1452 states have call successors, (1452) [2022-10-16 13:13:41,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7434 states to 7434 states and 10760 transitions. [2022-10-16 13:13:41,016 INFO L78 Accepts]: Start accepts. Automaton has 7434 states and 10760 transitions. Word has length 76 [2022-10-16 13:13:41,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:13:41,017 INFO L495 AbstractCegarLoop]: Abstraction has 7434 states and 10760 transitions. [2022-10-16 13:13:41,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 6 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-10-16 13:13:41,017 INFO L276 IsEmpty]: Start isEmpty. Operand 7434 states and 10760 transitions. [2022-10-16 13:13:41,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-10-16 13:13:41,020 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:13:41,020 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:13:41,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-16 13:13:41,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-10-16 13:13:41,235 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [dlci_to_q922Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, dlci_to_q922Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_set_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 107 more)] === [2022-10-16 13:13:41,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:13:41,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1900437506, now seen corresponding path program 1 times [2022-10-16 13:13:41,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:13:41,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950059731] [2022-10-16 13:13:41,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:13:41,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:13:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:41,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:13:41,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:41,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:13:41,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:41,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:13:41,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:41,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 13:13:41,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:41,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-10-16 13:13:41,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:41,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-16 13:13:41,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:41,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-16 13:13:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:41,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-16 13:13:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:41,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-10-16 13:13:41,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:41,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-10-16 13:13:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:41,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-16 13:13:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:41,562 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-10-16 13:13:41,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:13:41,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950059731] [2022-10-16 13:13:41,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950059731] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:13:41,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215024380] [2022-10-16 13:13:41,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:13:41,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:13:41,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:13:41,565 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 13:13:41,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-16 13:13:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:41,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 994 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-16 13:13:41,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:13:42,029 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-10-16 13:13:42,030 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 13:13:42,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215024380] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:13:42,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 13:13:42,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-10-16 13:13:42,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345567612] [2022-10-16 13:13:42,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:13:42,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 13:13:42,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:13:42,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 13:13:42,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-16 13:13:42,033 INFO L87 Difference]: Start difference. First operand 7434 states and 10760 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-10-16 13:13:42,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:13:42,866 INFO L93 Difference]: Finished difference Result 10400 states and 15299 transitions. [2022-10-16 13:13:42,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 13:13:42,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 77 [2022-10-16 13:13:42,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:13:42,919 INFO L225 Difference]: With dead ends: 10400 [2022-10-16 13:13:42,920 INFO L226 Difference]: Without dead ends: 10399 [2022-10-16 13:13:42,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-16 13:13:42,929 INFO L413 NwaCegarLoop]: 2822 mSDtfsCounter, 691 mSDsluCounter, 2340 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 5162 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 13:13:42,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 5162 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 13:13:42,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10399 states. [2022-10-16 13:13:43,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10399 to 7433. [2022-10-16 13:13:43,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7433 states, 5560 states have (on average 1.408093525179856) internal successors, (7829), 5720 states have internal predecessors, (7829), 1452 states have call successors, (1452), 328 states have call predecessors, (1452), 328 states have return successors, (1452), 1445 states have call predecessors, (1452), 1452 states have call successors, (1452) [2022-10-16 13:13:43,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7433 states to 7433 states and 10733 transitions. [2022-10-16 13:13:43,711 INFO L78 Accepts]: Start accepts. Automaton has 7433 states and 10733 transitions. Word has length 77 [2022-10-16 13:13:43,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:13:43,712 INFO L495 AbstractCegarLoop]: Abstraction has 7433 states and 10733 transitions. [2022-10-16 13:13:43,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-10-16 13:13:43,712 INFO L276 IsEmpty]: Start isEmpty. Operand 7433 states and 10733 transitions. [2022-10-16 13:13:43,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-10-16 13:13:43,722 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:13:43,723 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2022-10-16 13:13:43,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-16 13:13:43,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-10-16 13:13:43,938 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting fr_rxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [dlci_to_q922Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, dlci_to_q922Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_set_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 107 more)] === [2022-10-16 13:13:43,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:13:43,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1631426384, now seen corresponding path program 1 times [2022-10-16 13:13:43,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:13:43,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344256218] [2022-10-16 13:13:43,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:13:43,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:13:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:44,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:13:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:44,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:13:44,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:44,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:13:44,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:44,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 13:13:44,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:44,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-10-16 13:13:44,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:44,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-16 13:13:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:44,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-10-16 13:13:44,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:44,140 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-10-16 13:13:44,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:13:44,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344256218] [2022-10-16 13:13:44,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344256218] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:13:44,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:13:44,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 13:13:44,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297041095] [2022-10-16 13:13:44,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:13:44,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 13:13:44,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:13:44,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 13:13:44,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 13:13:44,145 INFO L87 Difference]: Start difference. First operand 7433 states and 10733 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-10-16 13:13:49,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:13:49,070 INFO L93 Difference]: Finished difference Result 18224 states and 26515 transitions. [2022-10-16 13:13:49,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 13:13:49,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 80 [2022-10-16 13:13:49,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:13:49,128 INFO L225 Difference]: With dead ends: 18224 [2022-10-16 13:13:49,128 INFO L226 Difference]: Without dead ends: 11272 [2022-10-16 13:13:49,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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:13:49,175 INFO L413 NwaCegarLoop]: 2359 mSDtfsCounter, 2323 mSDsluCounter, 2285 mSDsCounter, 0 mSdLazyCounter, 1687 mSolverCounterSat, 655 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2512 SdHoareTripleChecker+Valid, 4644 SdHoareTripleChecker+Invalid, 2342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 655 IncrementalHoareTripleChecker+Valid, 1687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-10-16 13:13:49,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2512 Valid, 4644 Invalid, 2342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [655 Valid, 1687 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-10-16 13:13:49,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11272 states. [2022-10-16 13:13:49,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11272 to 9964. [2022-10-16 13:13:49,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9964 states, 7537 states have (on average 1.4119676263765424) internal successors, (10642), 7718 states have internal predecessors, (10642), 1903 states have call successors, (1903), 431 states have call predecessors, (1903), 431 states have return successors, (1903), 1897 states have call predecessors, (1903), 1903 states have call successors, (1903) [2022-10-16 13:13:49,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9964 states to 9964 states and 14448 transitions. [2022-10-16 13:13:49,925 INFO L78 Accepts]: Start accepts. Automaton has 9964 states and 14448 transitions. Word has length 80 [2022-10-16 13:13:49,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:13:49,926 INFO L495 AbstractCegarLoop]: Abstraction has 9964 states and 14448 transitions. [2022-10-16 13:13:49,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-10-16 13:13:49,927 INFO L276 IsEmpty]: Start isEmpty. Operand 9964 states and 14448 transitions. [2022-10-16 13:13:49,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-10-16 13:13:49,929 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:13:49,929 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2022-10-16 13:13:49,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 13:13:49,931 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting fr_rxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [dlci_to_q922Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, dlci_to_q922Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_set_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 107 more)] === [2022-10-16 13:13:49,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:13:49,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1999837740, now seen corresponding path program 1 times [2022-10-16 13:13:49,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:13:49,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042361716] [2022-10-16 13:13:49,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:13:49,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:13:49,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:50,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:13:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:50,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:13:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:50,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:13:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:50,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 13:13:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:50,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-10-16 13:13:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:50,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-16 13:13:50,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:50,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-16 13:13:50,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:50,138 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-10-16 13:13:50,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:13:50,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042361716] [2022-10-16 13:13:50,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042361716] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:13:50,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:13:50,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 13:13:50,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080795896] [2022-10-16 13:13:50,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:13:50,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 13:13:50,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:13:50,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 13:13:50,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 13:13:50,141 INFO L87 Difference]: Start difference. First operand 9964 states and 14448 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-16 13:13:53,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:13:53,758 INFO L93 Difference]: Finished difference Result 20667 states and 30180 transitions. [2022-10-16 13:13:53,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 13:13:53,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 79 [2022-10-16 13:13:53,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:13:53,810 INFO L225 Difference]: With dead ends: 20667 [2022-10-16 13:13:53,811 INFO L226 Difference]: Without dead ends: 11184 [2022-10-16 13:13:53,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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:13:53,854 INFO L413 NwaCegarLoop]: 1832 mSDtfsCounter, 431 mSDsluCounter, 2157 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 3989 SdHoareTripleChecker+Invalid, 1521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-10-16 13:13:53,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 3989 Invalid, 1521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-10-16 13:13:53,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11184 states. [2022-10-16 13:13:54,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11184 to 9971. [2022-10-16 13:13:54,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9971 states, 7544 states have (on average 1.4115853658536586) internal successors, (10649), 7725 states have internal predecessors, (10649), 1903 states have call successors, (1903), 431 states have call predecessors, (1903), 431 states have return successors, (1903), 1897 states have call predecessors, (1903), 1903 states have call successors, (1903) [2022-10-16 13:13:54,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9971 states to 9971 states and 14455 transitions. [2022-10-16 13:13:54,495 INFO L78 Accepts]: Start accepts. Automaton has 9971 states and 14455 transitions. Word has length 79 [2022-10-16 13:13:54,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:13:54,496 INFO L495 AbstractCegarLoop]: Abstraction has 9971 states and 14455 transitions. [2022-10-16 13:13:54,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-16 13:13:54,497 INFO L276 IsEmpty]: Start isEmpty. Operand 9971 states and 14455 transitions. [2022-10-16 13:13:54,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-10-16 13:13:54,499 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:13:54,499 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2022-10-16 13:13:54,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-16 13:13:54,500 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting fr_rxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [dlci_to_q922Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, dlci_to_q922Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_set_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 107 more)] === [2022-10-16 13:13:54,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:13:54,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1999835818, now seen corresponding path program 1 times [2022-10-16 13:13:54,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:13:54,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656920446] [2022-10-16 13:13:54,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:13:54,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:13:54,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:54,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:13:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:54,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:13:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:54,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:13:54,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:54,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 13:13:54,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:54,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-10-16 13:13:54,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:54,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-16 13:13:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:54,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-16 13:13:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:54,788 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-10-16 13:13:54,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:13:54,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656920446] [2022-10-16 13:13:54,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656920446] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:13:54,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:13:54,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 13:13:54,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831956186] [2022-10-16 13:13:54,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:13:54,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 13:13:54,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:13:54,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 13:13:54,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 13:13:54,791 INFO L87 Difference]: Start difference. First operand 9971 states and 14455 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-16 13:13:58,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:13:58,573 INFO L93 Difference]: Finished difference Result 20695 states and 30208 transitions. [2022-10-16 13:13:58,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 13:13:58,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 79 [2022-10-16 13:13:58,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:13:58,625 INFO L225 Difference]: With dead ends: 20695 [2022-10-16 13:13:58,626 INFO L226 Difference]: Without dead ends: 11205 [2022-10-16 13:13:58,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-10-16 13:13:58,663 INFO L413 NwaCegarLoop]: 1831 mSDtfsCounter, 436 mSDsluCounter, 3583 mSDsCounter, 0 mSdLazyCounter, 1786 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 5414 SdHoareTripleChecker+Invalid, 2069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 1786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-10-16 13:13:58,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 5414 Invalid, 2069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 1786 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-10-16 13:13:58,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11205 states. [2022-10-16 13:13:59,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11205 to 9985. [2022-10-16 13:13:59,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9985 states, 7558 states have (on average 1.4108229690394285) internal successors, (10663), 7739 states have internal predecessors, (10663), 1903 states have call successors, (1903), 431 states have call predecessors, (1903), 431 states have return successors, (1903), 1897 states have call predecessors, (1903), 1903 states have call successors, (1903) [2022-10-16 13:13:59,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9985 states to 9985 states and 14469 transitions. [2022-10-16 13:13:59,609 INFO L78 Accepts]: Start accepts. Automaton has 9985 states and 14469 transitions. Word has length 79 [2022-10-16 13:13:59,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:13:59,610 INFO L495 AbstractCegarLoop]: Abstraction has 9985 states and 14469 transitions. [2022-10-16 13:13:59,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-16 13:13:59,610 INFO L276 IsEmpty]: Start isEmpty. Operand 9985 states and 14469 transitions. [2022-10-16 13:13:59,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-10-16 13:13:59,613 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:13:59,613 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2022-10-16 13:13:59,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-16 13:13:59,613 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting fr_rxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [dlci_to_q922Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, dlci_to_q922Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_set_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 107 more)] === [2022-10-16 13:13:59,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:13:59,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1997988776, now seen corresponding path program 1 times [2022-10-16 13:13:59,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:13:59,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328465833] [2022-10-16 13:13:59,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:13:59,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:13:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:14:00,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:14:00,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:14:00,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:14:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:14:00,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:14:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:14:00,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 13:14:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:14:00,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-10-16 13:14:00,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:14:00,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-16 13:14:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:14:00,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-16 13:14:00,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:14:00,743 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-10-16 13:14:00,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:14:00,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328465833] [2022-10-16 13:14:00,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328465833] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:14:00,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:14:00,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 13:14:00,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684872776] [2022-10-16 13:14:00,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:14:00,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 13:14:00,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:14:00,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 13:14:00,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-10-16 13:14:00,746 INFO L87 Difference]: Start difference. First operand 9985 states and 14469 transitions. Second operand has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-16 13:14:11,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:14:11,764 INFO L93 Difference]: Finished difference Result 11282 states and 16546 transitions. [2022-10-16 13:14:11,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-16 13:14:11,765 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 79 [2022-10-16 13:14:11,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:14:11,817 INFO L225 Difference]: With dead ends: 11282 [2022-10-16 13:14:11,817 INFO L226 Difference]: Without dead ends: 11280 [2022-10-16 13:14:11,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-10-16 13:14:11,826 INFO L413 NwaCegarLoop]: 1839 mSDtfsCounter, 774 mSDsluCounter, 5323 mSDsCounter, 0 mSdLazyCounter, 3704 mSolverCounterSat, 343 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 7162 SdHoareTripleChecker+Invalid, 4047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 343 IncrementalHoareTripleChecker+Valid, 3704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2022-10-16 13:14:11,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 7162 Invalid, 4047 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [343 Valid, 3704 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2022-10-16 13:14:11,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11280 states. [2022-10-16 13:14:12,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11280 to 9983. [2022-10-16 13:14:12,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9983 states, 7558 states have (on average 1.4089706271500397) internal successors, (10649), 7737 states have internal predecessors, (10649), 1903 states have call successors, (1903), 431 states have call predecessors, (1903), 431 states have return successors, (1903), 1897 states have call predecessors, (1903), 1903 states have call successors, (1903) [2022-10-16 13:14:12,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9983 states to 9983 states and 14455 transitions. [2022-10-16 13:14:12,663 INFO L78 Accepts]: Start accepts. Automaton has 9983 states and 14455 transitions. Word has length 79 [2022-10-16 13:14:12,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:14:12,664 INFO L495 AbstractCegarLoop]: Abstraction has 9983 states and 14455 transitions. [2022-10-16 13:14:12,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-16 13:14:12,664 INFO L276 IsEmpty]: Start isEmpty. Operand 9983 states and 14455 transitions. [2022-10-16 13:14:12,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-10-16 13:14:12,668 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:14:12,668 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:14:12,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-16 13:14:12,668 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [dlci_to_q922Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, dlci_to_q922Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_set_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 107 more)] === [2022-10-16 13:14:12,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:14:12,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1236647790, now seen corresponding path program 1 times [2022-10-16 13:14:12,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:14:12,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226478460] [2022-10-16 13:14:12,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:14:12,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:14:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:14:12,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:14:12,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:14:12,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:14:12,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:14:12,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:14:12,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:14:12,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 13:14:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:14:12,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-10-16 13:14:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:14:12,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-16 13:14:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:14:12,828 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-10-16 13:14:12,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:14:12,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226478460] [2022-10-16 13:14:12,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226478460] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:14:12,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:14:12,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 13:14:12,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602456396] [2022-10-16 13:14:12,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:14:12,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 13:14:12,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:14:12,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 13:14:12,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 13:14:12,831 INFO L87 Difference]: Start difference. First operand 9983 states and 14455 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-10-16 13:14:18,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:14:18,365 INFO L93 Difference]: Finished difference Result 22813 states and 33193 transitions. [2022-10-16 13:14:18,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 13:14:18,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 77 [2022-10-16 13:14:18,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:14:18,424 INFO L225 Difference]: With dead ends: 22813 [2022-10-16 13:14:18,425 INFO L226 Difference]: Without dead ends: 14376 [2022-10-16 13:14:18,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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:14:18,452 INFO L413 NwaCegarLoop]: 3425 mSDtfsCounter, 2038 mSDsluCounter, 2733 mSDsCounter, 0 mSdLazyCounter, 1917 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2253 SdHoareTripleChecker+Valid, 6158 SdHoareTripleChecker+Invalid, 2429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 1917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-10-16 13:14:18,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2253 Valid, 6158 Invalid, 2429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [512 Valid, 1917 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-10-16 13:14:18,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14376 states. [2022-10-16 13:14:19,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14376 to 12733. [2022-10-16 13:14:19,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12733 states, 9660 states have (on average 1.4080745341614906) internal successors, (13602), 9864 states have internal predecessors, (13602), 2426 states have call successors, (2426), 556 states have call predecessors, (2426), 556 states have return successors, (2426), 2418 states have call predecessors, (2426), 2426 states have call successors, (2426) [2022-10-16 13:14:19,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12733 states to 12733 states and 18454 transitions. [2022-10-16 13:14:19,333 INFO L78 Accepts]: Start accepts. Automaton has 12733 states and 18454 transitions. Word has length 77 [2022-10-16 13:14:19,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:14:19,333 INFO L495 AbstractCegarLoop]: Abstraction has 12733 states and 18454 transitions. [2022-10-16 13:14:19,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-10-16 13:14:19,334 INFO L276 IsEmpty]: Start isEmpty. Operand 12733 states and 18454 transitions. [2022-10-16 13:14:19,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-10-16 13:14:19,336 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:14:19,337 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:14:19,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-16 13:14:19,337 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [dlci_to_q922Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, dlci_to_q922Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_set_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 107 more)] === [2022-10-16 13:14:19,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:14:19,338 INFO L85 PathProgramCache]: Analyzing trace with hash 57386867, now seen corresponding path program 1 times [2022-10-16 13:14:19,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:14:19,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599106646] [2022-10-16 13:14:19,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:14:19,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:14:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 13:14:19,523 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-16 13:14:19,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 13:14:19,704 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-16 13:14:19,705 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-16 13:14:19,706 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (109 of 110 remaining) [2022-10-16 13:14:19,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location dlci_to_q922Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (108 of 110 remaining) [2022-10-16 13:14:19,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location dlci_to_q922Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (107 of 110 remaining) [2022-10-16 13:14:19,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_set_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (106 of 110 remaining) [2022-10-16 13:14:19,711 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_set_removeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (105 of 110 remaining) [2022-10-16 13:14:19,711 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_set_removeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (104 of 110 remaining) [2022-10-16 13:14:19,711 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_set_removeErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (103 of 110 remaining) [2022-10-16 13:14:19,711 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_set_removeErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (102 of 110 remaining) [2022-10-16 13:14:19,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_set_removeErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (101 of 110 remaining) [2022-10-16 13:14:19,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_set_removeErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (100 of 110 remaining) [2022-10-16 13:14:19,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_set_removeErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (99 of 110 remaining) [2022-10-16 13:14:19,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_set_removeErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (98 of 110 remaining) [2022-10-16 13:14:19,713 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_set_removeErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 110 remaining) [2022-10-16 13:14:19,713 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_lmi_sendErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 110 remaining) [2022-10-16 13:14:19,713 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_lmi_sendErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 110 remaining) [2022-10-16 13:14:19,713 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_lmi_sendErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 110 remaining) [2022-10-16 13:14:19,714 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_lmi_sendErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 110 remaining) [2022-10-16 13:14:19,714 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_lmi_sendErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 110 remaining) [2022-10-16 13:14:19,714 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_lmi_sendErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 110 remaining) [2022-10-16 13:14:19,714 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_lmi_sendErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 110 remaining) [2022-10-16 13:14:19,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_lmi_sendErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 110 remaining) [2022-10-16 13:14:19,716 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_lmi_sendErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 110 remaining) [2022-10-16 13:14:19,716 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_lmi_sendErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 110 remaining) [2022-10-16 13:14:19,716 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_lmi_sendErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 110 remaining) [2022-10-16 13:14:19,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_lmi_sendErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 110 remaining) [2022-10-16 13:14:19,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_lmi_sendErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 110 remaining) [2022-10-16 13:14:19,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_lmi_sendErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 110 remaining) [2022-10-16 13:14:19,718 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_lmi_sendErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 110 remaining) [2022-10-16 13:14:19,718 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_lmi_sendErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 110 remaining) [2022-10-16 13:14:19,718 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_lmi_sendErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 110 remaining) [2022-10-16 13:14:19,719 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_lmi_sendErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 110 remaining) [2022-10-16 13:14:19,719 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_lmi_sendErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 110 remaining) [2022-10-16 13:14:19,719 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_lmi_sendErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 110 remaining) [2022-10-16 13:14:19,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_lmi_sendErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 110 remaining) [2022-10-16 13:14:19,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_lmi_sendErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 110 remaining) [2022-10-16 13:14:19,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_lmi_sendErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 110 remaining) [2022-10-16 13:14:19,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_lmi_sendErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 110 remaining) [2022-10-16 13:14:19,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_lmi_sendErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 110 remaining) [2022-10-16 13:14:19,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_lmi_sendErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 110 remaining) [2022-10-16 13:14:19,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_lmi_sendErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 110 remaining) [2022-10-16 13:14:19,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_lmi_sendErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 110 remaining) [2022-10-16 13:14:19,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_lmi_sendErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 110 remaining) [2022-10-16 13:14:19,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_lmi_sendErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 110 remaining) [2022-10-16 13:14:19,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_lmi_sendErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 110 remaining) [2022-10-16 13:14:19,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_lmi_sendErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 110 remaining) [2022-10-16 13:14:19,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_lmi_sendErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 110 remaining) [2022-10-16 13:14:19,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_lmi_sendErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 110 remaining) [2022-10-16 13:14:19,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_lmi_sendErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 110 remaining) [2022-10-16 13:14:19,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_lmi_sendErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 110 remaining) [2022-10-16 13:14:19,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_lmi_sendErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 110 remaining) [2022-10-16 13:14:19,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_lmi_sendErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 110 remaining) [2022-10-16 13:14:19,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_skb_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 110 remaining) [2022-10-16 13:14:19,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_skb_allocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 110 remaining) [2022-10-16 13:14:19,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_skb_allocErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 110 remaining) [2022-10-16 13:14:19,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_skb_allocErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 110 remaining) [2022-10-16 13:14:19,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_rxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 110 remaining) [2022-10-16 13:14:19,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_rxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 110 remaining) [2022-10-16 13:14:19,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_rxErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 110 remaining) [2022-10-16 13:14:19,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_rxErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 110 remaining) [2022-10-16 13:14:19,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_rxErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 110 remaining) [2022-10-16 13:14:19,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_rxErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 110 remaining) [2022-10-16 13:14:19,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_rxErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 110 remaining) [2022-10-16 13:14:19,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_rxErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 110 remaining) [2022-10-16 13:14:19,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_rxErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 110 remaining) [2022-10-16 13:14:19,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_rxErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 110 remaining) [2022-10-16 13:14:19,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_rxErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 110 remaining) [2022-10-16 13:14:19,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_rxErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 110 remaining) [2022-10-16 13:14:19,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_rxErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 110 remaining) [2022-10-16 13:14:19,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_rxErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 110 remaining) [2022-10-16 13:14:19,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_rxErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 110 remaining) [2022-10-16 13:14:19,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_rxErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 110 remaining) [2022-10-16 13:14:19,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_rxErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 110 remaining) [2022-10-16 13:14:19,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_rxErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 110 remaining) [2022-10-16 13:14:19,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_rxErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 110 remaining) [2022-10-16 13:14:19,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_rxErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 110 remaining) [2022-10-16 13:14:19,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_rxErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 110 remaining) [2022-10-16 13:14:19,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_rxErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 110 remaining) [2022-10-16 13:14:19,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_rxErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 110 remaining) [2022-10-16 13:14:19,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_rxErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 110 remaining) [2022-10-16 13:14:19,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_rxErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 110 remaining) [2022-10-16 13:14:19,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_rxErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 110 remaining) [2022-10-16 13:14:19,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_rxErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 110 remaining) [2022-10-16 13:14:19,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_rxErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 110 remaining) [2022-10-16 13:14:19,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_rxErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 110 remaining) [2022-10-16 13:14:19,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_rxErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 110 remaining) [2022-10-16 13:14:19,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_rxErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 110 remaining) [2022-10-16 13:14:19,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_rxErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 110 remaining) [2022-10-16 13:14:19,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_rxErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 110 remaining) [2022-10-16 13:14:19,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_rxErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 110 remaining) [2022-10-16 13:14:19,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_ioctlErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 110 remaining) [2022-10-16 13:14:19,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_ioctlErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 110 remaining) [2022-10-16 13:14:19,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_ioctlErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 110 remaining) [2022-10-16 13:14:19,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fr_ioctlErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 110 remaining) [2022-10-16 13:14:19,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __fswab16Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 110 remaining) [2022-10-16 13:14:19,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __fswab16Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 110 remaining) [2022-10-16 13:14:19,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 110 remaining) [2022-10-16 13:14:19,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 110 remaining) [2022-10-16 13:14:19,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 110 remaining) [2022-10-16 13:14:19,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 110 remaining) [2022-10-16 13:14:19,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 110 remaining) [2022-10-16 13:14:19,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 110 remaining) [2022-10-16 13:14:19,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 110 remaining) [2022-10-16 13:14:19,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 110 remaining) [2022-10-16 13:14:19,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 110 remaining) [2022-10-16 13:14:19,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 110 remaining) [2022-10-16 13:14:19,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 110 remaining) [2022-10-16 13:14:19,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 110 remaining) [2022-10-16 13:14:19,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 110 remaining) [2022-10-16 13:14:19,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 110 remaining) [2022-10-16 13:14:19,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 110 remaining) [2022-10-16 13:14:19,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-16 13:14:19,748 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:14:19,755 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 13:14:19,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:14:19 BoogieIcfgContainer [2022-10-16 13:14:19,941 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 13:14:19,942 INFO L158 Benchmark]: Toolchain (without parser) took 86431.55ms. Allocated memory was 151.0MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 114.5MB in the beginning and 960.3MB in the end (delta: -845.8MB). Peak memory consumption was 164.3MB. Max. memory is 8.0GB. [2022-10-16 13:14:19,942 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 151.0MB. Free memory was 121.3MB in the beginning and 121.1MB in the end (delta: 152.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 13:14:19,943 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2479.54ms. Allocated memory was 151.0MB in the beginning and 201.3MB in the end (delta: 50.3MB). Free memory was 114.3MB in the beginning and 122.2MB in the end (delta: -7.9MB). Peak memory consumption was 99.6MB. Max. memory is 8.0GB. [2022-10-16 13:14:19,943 INFO L158 Benchmark]: Boogie Procedure Inliner took 379.82ms. Allocated memory is still 201.3MB. Free memory was 122.2MB in the beginning and 142.6MB in the end (delta: -20.4MB). Peak memory consumption was 25.7MB. Max. memory is 8.0GB. [2022-10-16 13:14:19,944 INFO L158 Benchmark]: Boogie Preprocessor took 337.50ms. Allocated memory is still 201.3MB. Free memory was 142.6MB in the beginning and 119.8MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-10-16 13:14:19,944 INFO L158 Benchmark]: RCFGBuilder took 3802.59ms. Allocated memory was 201.3MB in the beginning and 353.4MB in the end (delta: 152.0MB). Free memory was 119.8MB in the beginning and 213.1MB in the end (delta: -93.3MB). Peak memory consumption was 82.3MB. Max. memory is 8.0GB. [2022-10-16 13:14:19,945 INFO L158 Benchmark]: TraceAbstraction took 79414.37ms. Allocated memory was 353.4MB in the beginning and 1.2GB in the end (delta: 807.4MB). Free memory was 212.0MB in the beginning and 960.3MB in the end (delta: -748.3MB). Peak memory consumption was 59.1MB. Max. memory is 8.0GB. [2022-10-16 13:14:19,947 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.34ms. Allocated memory is still 151.0MB. Free memory was 121.3MB in the beginning and 121.1MB in the end (delta: 152.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 2479.54ms. Allocated memory was 151.0MB in the beginning and 201.3MB in the end (delta: 50.3MB). Free memory was 114.3MB in the beginning and 122.2MB in the end (delta: -7.9MB). Peak memory consumption was 99.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 379.82ms. Allocated memory is still 201.3MB. Free memory was 122.2MB in the beginning and 142.6MB in the end (delta: -20.4MB). Peak memory consumption was 25.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 337.50ms. Allocated memory is still 201.3MB. Free memory was 142.6MB in the beginning and 119.8MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * RCFGBuilder took 3802.59ms. Allocated memory was 201.3MB in the beginning and 353.4MB in the end (delta: 152.0MB). Free memory was 119.8MB in the beginning and 213.1MB in the end (delta: -93.3MB). Peak memory consumption was 82.3MB. Max. memory is 8.0GB. * TraceAbstraction took 79414.37ms. Allocated memory was 353.4MB in the beginning and 1.2GB in the end (delta: 807.4MB). Free memory was 212.0MB in the beginning and 960.3MB in the end (delta: -748.3MB). Peak memory consumption was 59.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: 5808]: integer overflow possible integer overflow possible We found a FailurePath: [L5416] int LDV_IN_INTERRUPT = 1; [L5417] int ldv_state_variable_0 ; [L5418] int ldv_state_variable_3 ; [L5419] struct net_device *proto_group0 ; [L5420] int ldv_timer_state_1 = 0; [L5421] int ldv_state_variable_2 ; [L5422] int ref_cnt ; [L5423] int ldv_state_variable_1 ; [L5424] struct net_device *pvc_ops_group1 ; [L5425] struct timer_list *ldv_timer_list_1 ; [L6872-L6875] static struct net_device_ops const pvc_ops = {0, 0, & pvc_open, & pvc_close, & pvc_xmit, 0, 0, 0, 0, 0, & pvc_ioctl, 0, & hdlc_change_mtu, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}; [L7029-L7031] static struct hdlc_proto proto = {0, & fr_close, & fr_start, & fr_stop, & fr_destroy, & fr_ioctl, 0, & fr_rx, 0, & __this_module, 0}; [L7196] int ldv_retval_2 ; [L7198] int ldv_retval_0 ; [L7201] int ldv_retval_1 ; [L7636] Element set_impl[15] ; [L7637] int last_index = 0; [L7771] Set LDV_SKBS ; VAL [__this_module={4294967299:4294967298}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, proto={40:0}, proto_group0={0:0}, pvc_ops={39:0}, pvc_ops_group1={0:0}, ref_cnt=0, set_impl={41:0}] [L7272] int ldvarg1 ; [L7273] int tmp ; [L7274] struct ifreq *ldvarg3 ; [L7275] void *tmp___0 ; [L7276] struct sk_buff *ldvarg0 ; [L7277] void *tmp___1 ; [L7278] int ldvarg2 ; [L7279] int tmp___2 ; [L7280] struct sk_buff *ldvarg4 ; [L7281] void *tmp___3 ; [L7282] struct ifreq *ldvarg5 ; [L7283] void *tmp___4 ; [L7284] int tmp___5 ; [L7285] int tmp___6 ; [L7286] int tmp___7 ; [L7287] int tmp___8 ; [L7289] tmp = __VERIFIER_nondet_int() [L7290] ldvarg1 = tmp VAL [__this_module={4294967299:4294967298}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldvarg1=-2, proto={40:0}, proto_group0={0:0}, pvc_ops={39:0}, pvc_ops_group1={0:0}, ref_cnt=0, set_impl={41:0}, tmp=-2] [L7291] CALL, EXPR ldv_zalloc(40UL) VAL [__this_module={4294967299:4294967298}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, proto={40:0}, proto_group0={0:0}, pvc_ops={39:0}, pvc_ops_group1={0:0}, ref_cnt=0, set_impl={41:0}] [L5358] void *p ; [L5359] void *tmp ; [L5360] int tmp___0 ; [L5362] tmp___0 = __VERIFIER_nondet_int() [L5363] COND TRUE tmp___0 != 0 [L5364] return ((void *)0); VAL [\old(size)=40, \result={0:0}, __this_module={4294967299:4294967298}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, proto={40:0}, proto_group0={0:0}, pvc_ops={39:0}, pvc_ops_group1={0:0}, ref_cnt=0, set_impl={41:0}, size=40, tmp___0=-3] [L7291] RET, EXPR ldv_zalloc(40UL) VAL [__this_module={4294967299:4294967298}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldv_zalloc(40UL)={0:0}, ldvarg1=-2, proto={40:0}, proto_group0={0:0}, pvc_ops={39:0}, pvc_ops_group1={0:0}, ref_cnt=0, set_impl={41:0}, tmp=-2] [L7291] tmp___0 = ldv_zalloc(40UL) [L7292] ldvarg3 = (struct ifreq *)tmp___0 VAL [__this_module={4294967299:4294967298}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldvarg1=-2, ldvarg3={0:0}, proto={40:0}, proto_group0={0:0}, pvc_ops={39:0}, pvc_ops_group1={0:0}, ref_cnt=0, set_impl={41:0}, tmp=-2, tmp___0={0:0}] [L7293] CALL, EXPR ldv_zalloc(232UL) VAL [__this_module={4294967299:4294967298}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, proto={40:0}, proto_group0={0:0}, pvc_ops={39:0}, pvc_ops_group1={0:0}, ref_cnt=0, set_impl={41:0}] [L5358] void *p ; [L5359] void *tmp ; [L5360] int tmp___0 ; [L5362] tmp___0 = __VERIFIER_nondet_int() [L5363] COND TRUE tmp___0 != 0 [L5364] return ((void *)0); VAL [\old(size)=232, \result={0:0}, __this_module={4294967299:4294967298}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, proto={40:0}, proto_group0={0:0}, pvc_ops={39:0}, pvc_ops_group1={0:0}, ref_cnt=0, set_impl={41:0}, size=232, tmp___0=-4] [L7293] RET, EXPR ldv_zalloc(232UL) VAL [__this_module={4294967299:4294967298}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldv_zalloc(232UL)={0:0}, ldvarg1=-2, ldvarg3={0:0}, proto={40:0}, proto_group0={0:0}, pvc_ops={39:0}, pvc_ops_group1={0:0}, ref_cnt=0, set_impl={41:0}, tmp=-2, tmp___0={0:0}] [L7293] tmp___1 = ldv_zalloc(232UL) [L7294] ldvarg0 = (struct sk_buff *)tmp___1 [L7295] tmp___2 = __VERIFIER_nondet_int() [L7296] ldvarg2 = tmp___2 VAL [__this_module={4294967299:4294967298}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldvarg0={0:0}, ldvarg1=-2, ldvarg2=-5, ldvarg3={0:0}, proto={40:0}, proto_group0={0:0}, pvc_ops={39:0}, pvc_ops_group1={0:0}, ref_cnt=0, set_impl={41:0}, tmp=-2, tmp___0={0:0}, tmp___1={0:0}, tmp___2=-5] [L7297] CALL, EXPR ldv_zalloc(232UL) VAL [__this_module={4294967299:4294967298}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, proto={40:0}, proto_group0={0:0}, pvc_ops={39:0}, pvc_ops_group1={0:0}, ref_cnt=0, set_impl={41:0}] [L5358] void *p ; [L5359] void *tmp ; [L5360] int tmp___0 ; [L5362] tmp___0 = __VERIFIER_nondet_int() [L5363] COND TRUE tmp___0 != 0 [L5364] return ((void *)0); VAL [\old(size)=232, \result={0:0}, __this_module={4294967299:4294967298}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, proto={40:0}, proto_group0={0:0}, pvc_ops={39:0}, pvc_ops_group1={0:0}, ref_cnt=0, set_impl={41:0}, size=232, tmp___0=-6] [L7297] RET, EXPR ldv_zalloc(232UL) VAL [__this_module={4294967299:4294967298}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldv_zalloc(232UL)={0:0}, ldvarg0={0:0}, ldvarg1=-2, ldvarg2=-5, ldvarg3={0:0}, proto={40:0}, proto_group0={0:0}, pvc_ops={39:0}, pvc_ops_group1={0:0}, ref_cnt=0, set_impl={41:0}, tmp=-2, tmp___0={0:0}, tmp___1={0:0}, tmp___2=-5] [L7297] tmp___3 = ldv_zalloc(232UL) [L7298] ldvarg4 = (struct sk_buff *)tmp___3 VAL [__this_module={4294967299:4294967298}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldvarg0={0:0}, ldvarg1=-2, ldvarg2=-5, ldvarg3={0:0}, ldvarg4={0:0}, proto={40:0}, proto_group0={0:0}, pvc_ops={39:0}, pvc_ops_group1={0:0}, ref_cnt=0, set_impl={41:0}, tmp=-2, tmp___0={0:0}, tmp___1={0:0}, tmp___2=-5, tmp___3={0:0}] [L7299] CALL, EXPR ldv_zalloc(40UL) VAL [__this_module={4294967299:4294967298}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, proto={40:0}, proto_group0={0:0}, pvc_ops={39:0}, pvc_ops_group1={0:0}, ref_cnt=0, set_impl={41:0}] [L5358] void *p ; [L5359] void *tmp ; [L5360] int tmp___0 ; [L5362] tmp___0 = __VERIFIER_nondet_int() [L5363] COND TRUE tmp___0 != 0 [L5364] return ((void *)0); VAL [\old(size)=40, \result={0:0}, __this_module={4294967299:4294967298}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, proto={40:0}, proto_group0={0:0}, pvc_ops={39:0}, pvc_ops_group1={0:0}, ref_cnt=0, set_impl={41:0}, size=40, tmp___0=-7] [L7299] RET, EXPR ldv_zalloc(40UL) VAL [__this_module={4294967299:4294967298}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldv_zalloc(40UL)={0:0}, ldvarg0={0:0}, ldvarg1=-2, ldvarg2=-5, ldvarg3={0:0}, ldvarg4={0:0}, proto={40:0}, proto_group0={0:0}, pvc_ops={39:0}, pvc_ops_group1={0:0}, ref_cnt=0, set_impl={41:0}, tmp=-2, tmp___0={0:0}, tmp___1={0:0}, tmp___2=-5, tmp___3={0:0}] [L7299] tmp___4 = ldv_zalloc(40UL) [L7300] ldvarg5 = (struct ifreq *)tmp___4 [L7301] CALL ldv_initialize() [L7790] CALL ldv_set_init(LDV_SKBS) [L7642] set = set_impl [L7643] last_index = 0 VAL [__this_module={4294967299:4294967298}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, proto={40:0}, proto_group0={0:0}, pvc_ops={39:0}, pvc_ops_group1={0:0}, ref_cnt=0, set={0:0}, set={41:0}, set_impl={41:0}] [L7790] RET ldv_set_init(LDV_SKBS) [L7301] RET ldv_initialize() [L7302] ldv_state_variable_1 = 1 [L7303] ref_cnt = 0 [L7304] ldv_state_variable_0 = 1 [L7305] ldv_state_variable_3 = 0 [L7306] ldv_state_variable_2 = 0 VAL [__this_module={4294967299:4294967298}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldvarg0={0:0}, ldvarg1=-2, ldvarg2=-5, ldvarg3={0:0}, ldvarg4={0:0}, ldvarg5={0:0}, proto={40:0}, proto_group0={0:0}, pvc_ops={39:0}, pvc_ops_group1={0:0}, ref_cnt=0, set_impl={41:0}, tmp=-2, tmp___0={0:0}, tmp___1={0:0}, tmp___2=-5, tmp___3={0:0}, tmp___4={0:0}] [L7308] tmp___5 = __VERIFIER_nondet_int() [L7310] case 0: [L7316] case 1: VAL [__this_module={4294967299:4294967298}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldvarg0={0:0}, ldvarg1=-2, ldvarg2=-5, ldvarg3={0:0}, ldvarg4={0:0}, ldvarg5={0:0}, proto={40:0}, proto_group0={0:0}, pvc_ops={39:0}, pvc_ops_group1={0:0}, ref_cnt=0, set_impl={41:0}, tmp=-2, tmp___0={0:0}, tmp___1={0:0}, tmp___2=-5, tmp___3={0:0}, tmp___4={0:0}, tmp___5=1] [L7317] COND TRUE ldv_state_variable_0 != 0 [L7318] tmp___6 = __VERIFIER_nondet_int() [L7320] case 0: [L7328] case 1: VAL [__this_module={4294967299:4294967298}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldvarg0={0:0}, ldvarg1=-2, ldvarg2=-5, ldvarg3={0:0}, ldvarg4={0:0}, ldvarg5={0:0}, proto={40:0}, proto_group0={0:0}, pvc_ops={39:0}, pvc_ops_group1={0:0}, ref_cnt=0, set_impl={41:0}, tmp=-2, tmp___0={0:0}, tmp___1={0:0}, tmp___2=-5, tmp___3={0:0}, tmp___4={0:0}, tmp___5=1, tmp___6=1] [L7329] COND TRUE ldv_state_variable_0 == 1 [L7330] CALL, EXPR mod_init() [L7184] FCALL register_hdlc_protocol(& proto) [L7185] return (0); VAL [\result=0, __this_module={4294967299:4294967298}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, proto={40:0}, proto_group0={0:0}, pvc_ops={39:0}, pvc_ops_group1={0:0}, ref_cnt=0, set_impl={41:0}] [L7330] RET, EXPR mod_init() [L7330] ldv_retval_0 = mod_init() [L7331] COND TRUE ldv_retval_0 == 0 [L7332] ldv_state_variable_0 = 3 [L7333] ldv_state_variable_2 = 1 [L7334] CALL ldv_initialize_hdlc_proto_2() [L7252] void *tmp ; VAL [__this_module={4294967299:4294967298}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, proto={40:0}, proto_group0={0:0}, pvc_ops={39:0}, pvc_ops_group1={0:0}, ref_cnt=0, set_impl={41:0}] [L7254] CALL, EXPR ldv_zalloc(3264UL) VAL [__this_module={4294967299:4294967298}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, proto={40:0}, proto_group0={0:0}, pvc_ops={39:0}, pvc_ops_group1={0:0}, ref_cnt=0, set_impl={41:0}] [L5358] void *p ; [L5359] void *tmp ; [L5360] int tmp___0 ; [L5362] tmp___0 = __VERIFIER_nondet_int() [L5363] COND TRUE tmp___0 != 0 [L5364] return ((void *)0); VAL [\old(size)=3264, \result={0:0}, __this_module={4294967299:4294967298}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, proto={40:0}, proto_group0={0:0}, pvc_ops={39:0}, pvc_ops_group1={0:0}, ref_cnt=0, set_impl={41:0}, size=3264, tmp___0=-8] [L7254] RET, EXPR ldv_zalloc(3264UL) VAL [__this_module={4294967299:4294967298}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldv_zalloc(3264UL)={0:0}, proto={40:0}, proto_group0={0:0}, pvc_ops={39:0}, pvc_ops_group1={0:0}, ref_cnt=0, set_impl={41:0}] [L7254] tmp = ldv_zalloc(3264UL) [L7255] proto_group0 = (struct net_device *)tmp VAL [__this_module={4294967299:4294967298}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, proto={40:0}, proto_group0={0:0}, pvc_ops={39:0}, pvc_ops_group1={0:0}, ref_cnt=0, set_impl={41:0}, tmp={0:0}] [L7334] RET ldv_initialize_hdlc_proto_2() [L7335] ldv_state_variable_3 = 1 [L7336] CALL ldv_net_device_ops_3() [L7207] void *tmp ; VAL [__this_module={4294967299:4294967298}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, proto={40:0}, proto_group0={0:0}, pvc_ops={39:0}, pvc_ops_group1={0:0}, ref_cnt=0, set_impl={41:0}] [L7209] CALL, EXPR ldv_zalloc(3264UL) VAL [__this_module={4294967299:4294967298}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, proto={40:0}, proto_group0={0:0}, pvc_ops={39:0}, pvc_ops_group1={0:0}, ref_cnt=0, set_impl={41:0}] [L5358] void *p ; [L5359] void *tmp ; [L5360] int tmp___0 ; [L5362] tmp___0 = __VERIFIER_nondet_int() [L5363] COND TRUE tmp___0 != 0 [L5364] return ((void *)0); VAL [\old(size)=3264, \result={0:0}, __this_module={4294967299:4294967298}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, proto={40:0}, proto_group0={0:0}, pvc_ops={39:0}, pvc_ops_group1={0:0}, ref_cnt=0, set_impl={41:0}, size=3264, tmp___0=-9] [L7209] RET, EXPR ldv_zalloc(3264UL) VAL [__this_module={4294967299:4294967298}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldv_zalloc(3264UL)={0:0}, proto={40:0}, proto_group0={0:0}, pvc_ops={39:0}, pvc_ops_group1={0:0}, ref_cnt=0, set_impl={41:0}] [L7209] tmp = ldv_zalloc(3264UL) [L7210] pvc_ops_group1 = (struct net_device *)tmp VAL [__this_module={4294967299:4294967298}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, proto={40:0}, proto_group0={0:0}, pvc_ops={39:0}, pvc_ops_group1={0:0}, ref_cnt=0, set_impl={41:0}, tmp={0:0}] [L7336] RET ldv_net_device_ops_3() [L7339] COND FALSE !(ldv_retval_0 != 0) VAL [__this_module={4294967299:4294967298}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldvarg0={0:0}, ldvarg1=-2, ldvarg2=-5, ldvarg3={0:0}, ldvarg4={0:0}, ldvarg5={0:0}, proto={40:0}, proto_group0={0:0}, pvc_ops={39:0}, pvc_ops_group1={0:0}, ref_cnt=0, set_impl={41:0}, tmp=-2, tmp___0={0:0}, tmp___1={0:0}, tmp___2=-5, tmp___3={0:0}, tmp___4={0:0}, tmp___5=1, tmp___6=1] [L7308] tmp___5 = __VERIFIER_nondet_int() [L7310] case 0: [L7316] case 1: [L7354] case 2: VAL [__this_module={4294967299:4294967298}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldvarg0={0:0}, ldvarg1=-2, ldvarg2=-5, ldvarg3={0:0}, ldvarg4={0:0}, ldvarg5={0:0}, proto={40:0}, proto_group0={0:0}, pvc_ops={39:0}, pvc_ops_group1={0:0}, ref_cnt=0, set_impl={41:0}, tmp=-2, tmp___0={0:0}, tmp___1={0:0}, tmp___2=-5, tmp___3={0:0}, tmp___4={0:0}, tmp___5=2, tmp___6=1] [L7355] COND TRUE ldv_state_variable_3 != 0 [L7356] tmp___7 = __VERIFIER_nondet_int() [L7358] case 0: [L7365] case 1: [L7382] case 2: [L7394] case 3: [L7404] case 4: [L7411] case 5: VAL [__this_module={4294967299:4294967298}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldvarg0={0:0}, ldvarg1=-2, ldvarg2=-5, ldvarg3={0:0}, ldvarg4={0:0}, ldvarg5={0:0}, proto={40:0}, proto_group0={0:0}, pvc_ops={39:0}, pvc_ops_group1={0:0}, ref_cnt=0, set_impl={41:0}, tmp=-2, tmp___0={0:0}, tmp___1={0:0}, tmp___2=-5, tmp___3={0:0}, tmp___4={0:0}, tmp___5=2, tmp___6=1, tmp___7=5] [L7412] COND TRUE ldv_state_variable_3 == 1 [L7413] CALL, EXPR ldv_ndo_init_3() [L7917] return __VERIFIER_nondet_int(); [L7413] RET, EXPR ldv_ndo_init_3() [L7413] ldv_retval_1 = ldv_ndo_init_3() [L7414] COND TRUE ldv_retval_1 == 0 [L7415] ldv_state_variable_3 = 2 VAL [__this_module={4294967299:4294967298}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=2, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldvarg0={0:0}, ldvarg1=-2, ldvarg2=-5, ldvarg3={0:0}, ldvarg4={0:0}, ldvarg5={0:0}, proto={40:0}, proto_group0={0:0}, pvc_ops={39:0}, pvc_ops_group1={0:0}, ref_cnt=0, set_impl={41:0}, tmp=-2, tmp___0={0:0}, tmp___1={0:0}, tmp___2=-5, tmp___3={0:0}, tmp___4={0:0}, tmp___5=2, tmp___6=1, tmp___7=5] [L7416] EXPR ref_cnt + 1 [L7416] ref_cnt = ref_cnt + 1 VAL [__this_module={4294967299:4294967298}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=2, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldvarg0={0:0}, ldvarg1=-2, ldvarg2=-5, ldvarg3={0:0}, ldvarg4={0:0}, ldvarg5={0:0}, proto={40:0}, proto_group0={0:0}, pvc_ops={39:0}, pvc_ops_group1={0:0}, ref_cnt=1, set_impl={41:0}, tmp=-2, tmp___0={0:0}, tmp___1={0:0}, tmp___2=-5, tmp___3={0:0}, tmp___4={0:0}, tmp___5=2, tmp___6=1, tmp___7=5] [L7308] tmp___5 = __VERIFIER_nondet_int() [L7310] case 0: [L7316] case 1: [L7354] case 2: VAL [__this_module={4294967299:4294967298}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=2, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldvarg0={0:0}, ldvarg1=-2, ldvarg2=-5, ldvarg3={0:0}, ldvarg4={0:0}, ldvarg5={0:0}, proto={40:0}, proto_group0={0:0}, pvc_ops={39:0}, pvc_ops_group1={0:0}, ref_cnt=1, set_impl={41:0}, tmp=-2, tmp___0={0:0}, tmp___1={0:0}, tmp___2=-5, tmp___3={0:0}, tmp___4={0:0}, tmp___5=2, tmp___6=1, tmp___7=5] [L7355] COND TRUE ldv_state_variable_3 != 0 [L7356] tmp___7 = __VERIFIER_nondet_int() [L7358] case 0: [L7365] case 1: [L7382] case 2: [L7394] case 3: VAL [__this_module={4294967299:4294967298}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=2, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldvarg0={0:0}, ldvarg1=-2, ldvarg2=-5, ldvarg3={0:0}, ldvarg4={0:0}, ldvarg5={0:0}, proto={40:0}, proto_group0={0:0}, pvc_ops={39:0}, pvc_ops_group1={0:0}, ref_cnt=1, set_impl={41:0}, tmp=-2, tmp___0={0:0}, tmp___1={0:0}, tmp___2=-5, tmp___3={0:0}, tmp___4={0:0}, tmp___5=2, tmp___6=1, tmp___7=3] [L7395] COND TRUE ldv_state_variable_3 == 2 [L7396] CALL pvc_open(pvc_ops_group1) [L5794] pvc_device *pvc ; [L5795] hdlc_device *hdlc ; [L5796] struct hdlc_device *tmp ; [L5797] bool tmp___0 ; [L5798] struct frad_state *tmp___1 ; [L5799] struct frad_state *tmp___2 ; [L5800] int tmp___3 ; [L5802] EXPR dev->ldv_39216.ml_priv [L5802] pvc = (pvc_device *)dev->ldv_39216.ml_priv [L5803] EXPR pvc->frad [L5803] EXPR (pvc->frad)->flags VAL [(pvc->frad)->flags=4294967297, __this_module={4294967299:4294967298}, dev={0:0}, dev={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=2, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, proto={40:0}, proto_group0={0:0}, pvc={4294967300:-31}, pvc->frad={4294967301:-10}, pvc_ops={39:0}, pvc_ops_group1={0:0}, ref_cnt=1, set_impl={41:0}] [L5803] COND FALSE !(((pvc->frad)->flags & 1U) == 0U) [L5807] EXPR pvc->open_count [L5807] tmp___3 = pvc->open_count [L5808] EXPR pvc->open_count VAL [__this_module={4294967299:4294967298}, dev={0:0}, dev={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=2, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, proto={40:0}, proto_group0={0:0}, pvc={4294967300:-31}, pvc->open_count=2147483647, pvc_ops={39:0}, pvc_ops_group1={0:0}, ref_cnt=1, set_impl={41:0}, tmp___3=2147483647] [L5808] pvc->open_count + 1 VAL [__this_module={4294967299:4294967298}, dev={0:0}, dev={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=2, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, proto={40:0}, proto_group0={0:0}, pvc={4294967300:-31}, pvc->open_count=2147483647, pvc_ops={39:0}, pvc_ops_group1={0:0}, ref_cnt=1, set_impl={41:0}, tmp___3=2147483647] - UnprovableResult [Line: 5540]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5540]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7690]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7690]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7693]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7693]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7699]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7699]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7700]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7700]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7702]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7702]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6019]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6019]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6019]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6019]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6019]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6019]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6045]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6045]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6048]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6048]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6052]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6052]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6057]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6057]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6060]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6060]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6063]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6063]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6066]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6066]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6069]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6069]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6072]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6072]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5966]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5966]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6079]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6079]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6086]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6086]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6089]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6089]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6110]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6110]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6120]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6120]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5323]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5323]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7662]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7662]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7666]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7666]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5533]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5533]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6418]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6418]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6425]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6425]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6433]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6433]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6440]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6440]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6447]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6447]: 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: 6453]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6453]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6542]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6542]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6549]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6549]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6554]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6554]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6554]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6554]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6556]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6556]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6578]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6578]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6580]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6580]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6580]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6580]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6941]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6941]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6978]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6978]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5144]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5144]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6282]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6282]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6308]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6308]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5836]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5836]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5808]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7416]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7416]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7426]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7426]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7479]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7479]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7552]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7552]: 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 52 procedures, 1378 locations, 110 error locations. Started 1 CEGAR loops. OverallTime: 79.1s, OverallIterations: 13, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 64.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19931 SdHoareTripleChecker+Valid, 56.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17940 mSDsluCounter, 64716 SdHoareTripleChecker+Invalid, 49.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36395 mSDsCounter, 5423 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21540 IncrementalHoareTripleChecker+Invalid, 26963 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5423 mSolverCounterUnsat, 28321 mSDtfsCounter, 21540 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 458 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12733occurred in iteration=12, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 20587 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 1059 NumberOfCodeBlocks, 1059 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1039 ConstructedInterpolants, 0 QuantifiedInterpolants, 2029 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1987 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 15 InterpolantComputations, 11 PerfectInterpolantSequences, 903/924 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:14:20,050 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...