/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-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 14:08:41,483 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 14:08:41,487 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 14:08:41,528 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 14:08:41,529 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 14:08:41,534 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 14:08:41,539 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 14:08:41,561 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 14:08:41,564 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 14:08:41,566 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 14:08:41,568 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 14:08:41,572 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 14:08:41,573 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 14:08:41,580 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 14:08:41,581 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 14:08:41,587 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 14:08:41,588 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 14:08:41,592 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 14:08:41,596 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 14:08:41,601 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 14:08:41,606 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 14:08:41,608 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 14:08:41,610 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 14:08:41,614 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 14:08:41,626 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 14:08:41,626 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 14:08:41,627 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 14:08:41,630 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 14:08:41,631 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 14:08:41,632 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 14:08:41,633 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 14:08:41,634 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 14:08:41,636 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 14:08:41,637 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 14:08:41,639 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 14:08:41,639 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 14:08:41,640 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 14:08:41,641 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 14:08:41,641 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 14:08:41,642 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 14:08:41,644 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 14:08:41,645 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 14:08:41,708 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 14:08:41,709 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 14:08:41,709 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 14:08:41,710 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 14:08:41,712 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 14:08:41,712 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 14:08:41,714 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 14:08:41,715 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 14:08:41,715 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 14:08:41,715 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 14:08:41,717 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 14:08:41,717 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 14:08:41,717 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 14:08:41,718 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 14:08:41,718 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 14:08:41,718 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 14:08:41,718 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 14:08:41,719 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 14:08:41,719 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 14:08:41,720 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 14:08:41,720 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 14:08:41,720 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 14:08:41,720 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 14:08:41,721 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 14:08:41,721 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 14:08:41,721 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 14:08:41,722 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 14:08:41,722 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 14:08:41,722 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 14:08:41,723 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 14:08:41,723 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 14:08:41,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 14:08:41,724 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 14:08:41,724 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 14:08:42,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 14:08:42,187 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 14:08:42,190 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 14:08:42,192 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 14:08:42,192 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 14:08:42,195 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-10-16 14:08:42,293 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e582e9e6d/003ddda8b6464697aeca51ba29196a65/FLAG760141963 [2022-10-16 14:08:43,239 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 14:08:43,240 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-10-16 14:08:43,298 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e582e9e6d/003ddda8b6464697aeca51ba29196a65/FLAG760141963 [2022-10-16 14:08:43,794 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e582e9e6d/003ddda8b6464697aeca51ba29196a65 [2022-10-16 14:08:43,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 14:08:43,804 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 14:08:43,807 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 14:08:43,807 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 14:08:43,815 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 14:08:43,817 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:08:43" (1/1) ... [2022-10-16 14:08:43,819 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f12c8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:08:43, skipping insertion in model container [2022-10-16 14:08:43,819 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:08:43" (1/1) ... [2022-10-16 14:08:43,828 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 14:08:43,930 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 14:08:45,222 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-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i[121503,121516] [2022-10-16 14:08:45,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 14:08:45,277 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 14:08:45,566 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-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i[121503,121516] [2022-10-16 14:08:45,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 14:08:45,661 INFO L208 MainTranslator]: Completed translation [2022-10-16 14:08:45,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:08:45 WrapperNode [2022-10-16 14:08:45,663 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 14:08:45,664 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 14:08:45,665 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 14:08:45,665 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 14:08:45,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:08:45" (1/1) ... [2022-10-16 14:08:45,759 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:08:45" (1/1) ... [2022-10-16 14:08:45,917 INFO L138 Inliner]: procedures = 142, calls = 521, calls flagged for inlining = 83, calls inlined = 83, statements flattened = 1698 [2022-10-16 14:08:45,917 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 14:08:45,936 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 14:08:45,936 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 14:08:45,936 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 14:08:45,951 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:08:45" (1/1) ... [2022-10-16 14:08:45,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:08:45" (1/1) ... [2022-10-16 14:08:46,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:08:45" (1/1) ... [2022-10-16 14:08:46,022 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:08:45" (1/1) ... [2022-10-16 14:08:46,135 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:08:45" (1/1) ... [2022-10-16 14:08:46,155 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:08:45" (1/1) ... [2022-10-16 14:08:46,175 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:08:45" (1/1) ... [2022-10-16 14:08:46,184 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:08:45" (1/1) ... [2022-10-16 14:08:46,203 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 14:08:46,204 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 14:08:46,204 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 14:08:46,204 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 14:08:46,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:08:45" (1/1) ... [2022-10-16 14:08:46,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 14:08:46,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:08:46,246 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 14:08:46,269 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 14:08:46,315 INFO L130 BoogieDeclarations]: Found specification of procedure blk_queue_max_segment_size [2022-10-16 14:08:46,315 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_queue_max_segment_size [2022-10-16 14:08:46,315 INFO L130 BoogieDeclarations]: Found specification of procedure virtio_config_buf [2022-10-16 14:08:46,315 INFO L138 BoogieDeclarations]: Found implementation of procedure virtio_config_buf [2022-10-16 14:08:46,315 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-10-16 14:08:46,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-10-16 14:08:46,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 14:08:46,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-10-16 14:08:46,316 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-10-16 14:08:46,316 INFO L130 BoogieDeclarations]: Found specification of procedure req_get_ioprio [2022-10-16 14:08:46,316 INFO L138 BoogieDeclarations]: Found implementation of procedure req_get_ioprio [2022-10-16 14:08:46,317 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~TO~VOID [2022-10-16 14:08:46,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~TO~VOID [2022-10-16 14:08:46,317 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-10-16 14:08:46,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-10-16 14:08:46,317 INFO L130 BoogieDeclarations]: Found specification of procedure mempool_free [2022-10-16 14:08:46,317 INFO L138 BoogieDeclarations]: Found implementation of procedure mempool_free [2022-10-16 14:08:46,318 INFO L130 BoogieDeclarations]: Found specification of procedure sg_set_buf [2022-10-16 14:08:46,318 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_set_buf [2022-10-16 14:08:46,318 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-10-16 14:08:46,318 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-10-16 14:08:46,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 14:08:46,319 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-10-16 14:08:46,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-10-16 14:08:46,319 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-10-16 14:08:46,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-10-16 14:08:46,319 INFO L130 BoogieDeclarations]: Found specification of procedure index_to_minor [2022-10-16 14:08:46,319 INFO L138 BoogieDeclarations]: Found implementation of procedure index_to_minor [2022-10-16 14:08:46,320 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-10-16 14:08:46,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-10-16 14:08:46,320 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-10-16 14:08:46,320 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-10-16 14:08:46,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-16 14:08:46,321 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2022-10-16 14:08:46,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2022-10-16 14:08:46,321 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-10-16 14:08:46,321 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-10-16 14:08:46,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 14:08:46,322 INFO L130 BoogieDeclarations]: Found specification of procedure virtio_has_feature [2022-10-16 14:08:46,322 INFO L138 BoogieDeclarations]: Found implementation of procedure virtio_has_feature [2022-10-16 14:08:46,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 14:08:46,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-16 14:08:46,322 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-10-16 14:08:46,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-10-16 14:08:46,322 INFO L130 BoogieDeclarations]: Found specification of procedure virtblk_remove [2022-10-16 14:08:46,323 INFO L138 BoogieDeclarations]: Found implementation of procedure virtblk_remove [2022-10-16 14:08:46,323 INFO L130 BoogieDeclarations]: Found specification of procedure mempool_destroy [2022-10-16 14:08:46,323 INFO L138 BoogieDeclarations]: Found implementation of procedure mempool_destroy [2022-10-16 14:08:46,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-16 14:08:46,323 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2022-10-16 14:08:46,323 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2022-10-16 14:08:46,324 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-10-16 14:08:46,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-10-16 14:08:46,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 14:08:46,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-10-16 14:08:46,324 INFO L130 BoogieDeclarations]: Found specification of procedure put_disk [2022-10-16 14:08:46,324 INFO L138 BoogieDeclarations]: Found implementation of procedure put_disk [2022-10-16 14:08:46,325 INFO L130 BoogieDeclarations]: Found specification of procedure blk_queue_ordered [2022-10-16 14:08:46,325 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_queue_ordered [2022-10-16 14:08:46,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 14:08:46,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 14:08:46,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 14:08:46,326 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-10-16 14:08:46,326 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-10-16 14:08:46,821 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 14:08:46,825 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 14:08:47,599 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-10-16 14:08:48,620 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 14:08:48,641 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 14:08:48,641 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-16 14:08:48,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:08:48 BoogieIcfgContainer [2022-10-16 14:08:48,645 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 14:08:48,648 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 14:08:48,648 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 14:08:48,652 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 14:08:48,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 02:08:43" (1/3) ... [2022-10-16 14:08:48,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7861c2e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:08:48, skipping insertion in model container [2022-10-16 14:08:48,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:08:45" (2/3) ... [2022-10-16 14:08:48,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7861c2e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:08:48, skipping insertion in model container [2022-10-16 14:08:48,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:08:48" (3/3) ... [2022-10-16 14:08:48,656 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-10-16 14:08:48,679 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 14:08:48,680 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2022-10-16 14:08:48,780 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 14:08:48,789 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;@2ca17c67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 14:08:48,789 INFO L358 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2022-10-16 14:08:48,797 INFO L276 IsEmpty]: Start isEmpty. Operand has 526 states, 384 states have (on average 1.3541666666666667) internal successors, (520), 427 states have internal predecessors, (520), 84 states have call successors, (84), 26 states have call predecessors, (84), 25 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2022-10-16 14:08:48,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-10-16 14:08:48,809 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:08:48,810 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-16 14:08:48,811 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting index_to_minorErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2022-10-16 14:08:48,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:08:48,817 INFO L85 PathProgramCache]: Analyzing trace with hash 569538026, now seen corresponding path program 1 times [2022-10-16 14:08:48,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:08:48,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31950659] [2022-10-16 14:08:48,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:08:48,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:08:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:49,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 14:08:49,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:49,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:08:49,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:49,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:08:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:49,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-16 14:08:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:49,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-16 14:08:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:49,570 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-16 14:08:49,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:08:49,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31950659] [2022-10-16 14:08:49,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31950659] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:08:49,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:08:49,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 14:08:49,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394644399] [2022-10-16 14:08:49,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:08:49,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 14:08:49,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:08:49,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 14:08:49,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 14:08:49,655 INFO L87 Difference]: Start difference. First operand has 526 states, 384 states have (on average 1.3541666666666667) internal successors, (520), 427 states have internal predecessors, (520), 84 states have call successors, (84), 26 states have call predecessors, (84), 25 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 14:08:51,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:08:51,087 INFO L93 Difference]: Finished difference Result 1144 states and 1558 transitions. [2022-10-16 14:08:51,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 14:08:51,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2022-10-16 14:08:51,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:08:51,118 INFO L225 Difference]: With dead ends: 1144 [2022-10-16 14:08:51,118 INFO L226 Difference]: Without dead ends: 595 [2022-10-16 14:08:51,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-10-16 14:08:51,139 INFO L413 NwaCegarLoop]: 636 mSDtfsCounter, 371 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-10-16 14:08:51,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 1330 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-10-16 14:08:51,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2022-10-16 14:08:51,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 494. [2022-10-16 14:08:51,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 367 states have (on average 1.3051771117166213) internal successors, (479), 396 states have internal predecessors, (479), 77 states have call successors, (77), 24 states have call predecessors, (77), 24 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2022-10-16 14:08:51,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 633 transitions. [2022-10-16 14:08:51,258 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 633 transitions. Word has length 41 [2022-10-16 14:08:51,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:08:51,259 INFO L495 AbstractCegarLoop]: Abstraction has 494 states and 633 transitions. [2022-10-16 14:08:51,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 14:08:51,260 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 633 transitions. [2022-10-16 14:08:51,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-10-16 14:08:51,262 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:08:51,263 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-16 14:08:51,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 14:08:51,264 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting index_to_minorErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2022-10-16 14:08:51,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:08:51,264 INFO L85 PathProgramCache]: Analyzing trace with hash 592170280, now seen corresponding path program 1 times [2022-10-16 14:08:51,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:08:51,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726260757] [2022-10-16 14:08:51,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:08:51,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:08:51,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:51,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 14:08:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:51,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:08:51,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:51,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:08:51,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:51,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-16 14:08:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:51,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-16 14:08:51,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:51,544 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-16 14:08:51,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:08:51,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726260757] [2022-10-16 14:08:51,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726260757] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:08:51,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:08:51,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 14:08:51,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132879402] [2022-10-16 14:08:51,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:08:51,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 14:08:51,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:08:51,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 14:08:51,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-16 14:08:51,549 INFO L87 Difference]: Start difference. First operand 494 states and 633 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-10-16 14:08:52,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:08:52,738 INFO L93 Difference]: Finished difference Result 1211 states and 1578 transitions. [2022-10-16 14:08:52,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 14:08:52,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 41 [2022-10-16 14:08:52,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:08:52,748 INFO L225 Difference]: With dead ends: 1211 [2022-10-16 14:08:52,748 INFO L226 Difference]: Without dead ends: 731 [2022-10-16 14:08:52,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-10-16 14:08:52,753 INFO L413 NwaCegarLoop]: 608 mSDtfsCounter, 717 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 437 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 1434 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 437 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-10-16 14:08:52,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 1434 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [437 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-10-16 14:08:52,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2022-10-16 14:08:52,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 626. [2022-10-16 14:08:52,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 470 states have (on average 1.2957446808510638) internal successors, (609), 500 states have internal predecessors, (609), 95 states have call successors, (95), 35 states have call predecessors, (95), 35 states have return successors, (95), 94 states have call predecessors, (95), 95 states have call successors, (95) [2022-10-16 14:08:52,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 799 transitions. [2022-10-16 14:08:52,853 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 799 transitions. Word has length 41 [2022-10-16 14:08:52,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:08:52,854 INFO L495 AbstractCegarLoop]: Abstraction has 626 states and 799 transitions. [2022-10-16 14:08:52,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-10-16 14:08:52,857 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 799 transitions. [2022-10-16 14:08:52,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-10-16 14:08:52,871 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:08:52,872 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-10-16 14:08:52,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 14:08:52,873 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting index_to_minorErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2022-10-16 14:08:52,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:08:52,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1810377559, now seen corresponding path program 1 times [2022-10-16 14:08:52,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:08:52,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549290005] [2022-10-16 14:08:52,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:08:52,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:08:52,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:53,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 14:08:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:53,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:08:53,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:53,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:08:53,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:53,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-16 14:08:53,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:53,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-16 14:08:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:53,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-10-16 14:08:53,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:53,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:08:53,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:53,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:08:53,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:53,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-10-16 14:08:53,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:53,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:08:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:53,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:08:53,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:53,431 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-10-16 14:08:53,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:08:53,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549290005] [2022-10-16 14:08:53,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549290005] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:08:53,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:08:53,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 14:08:53,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335237957] [2022-10-16 14:08:53,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:08:53,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 14:08:53,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:08:53,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 14:08:53,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-10-16 14:08:53,435 INFO L87 Difference]: Start difference. First operand 626 states and 799 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-16 14:08:55,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:08:55,478 INFO L93 Difference]: Finished difference Result 1950 states and 2551 transitions. [2022-10-16 14:08:55,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-16 14:08:55,479 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 87 [2022-10-16 14:08:55,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:08:55,493 INFO L225 Difference]: With dead ends: 1950 [2022-10-16 14:08:55,493 INFO L226 Difference]: Without dead ends: 1338 [2022-10-16 14:08:55,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-10-16 14:08:55,499 INFO L413 NwaCegarLoop]: 637 mSDtfsCounter, 1375 mSDsluCounter, 1740 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 735 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1438 SdHoareTripleChecker+Valid, 2377 SdHoareTripleChecker+Invalid, 1862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 735 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-10-16 14:08:55,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1438 Valid, 2377 Invalid, 1862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [735 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-10-16 14:08:55,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2022-10-16 14:08:55,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1130. [2022-10-16 14:08:55,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 864 states have (on average 1.2777777777777777) internal successors, (1104), 898 states have internal predecessors, (1104), 173 states have call successors, (173), 67 states have call predecessors, (173), 67 states have return successors, (173), 171 states have call predecessors, (173), 173 states have call successors, (173) [2022-10-16 14:08:55,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1450 transitions. [2022-10-16 14:08:55,666 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1450 transitions. Word has length 87 [2022-10-16 14:08:55,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:08:55,667 INFO L495 AbstractCegarLoop]: Abstraction has 1130 states and 1450 transitions. [2022-10-16 14:08:55,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-16 14:08:55,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1450 transitions. [2022-10-16 14:08:55,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-10-16 14:08:55,670 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:08:55,671 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1] [2022-10-16 14:08:55,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 14:08:55,671 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2022-10-16 14:08:55,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:08:55,672 INFO L85 PathProgramCache]: Analyzing trace with hash 104237165, now seen corresponding path program 1 times [2022-10-16 14:08:55,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:08:55,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578927239] [2022-10-16 14:08:55,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:08:55,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:08:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:55,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 14:08:55,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:55,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:08:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:55,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:08:55,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:55,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-16 14:08:55,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:55,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-16 14:08:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:55,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-10-16 14:08:55,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:56,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:08:56,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:56,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:08:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:56,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-10-16 14:08:56,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:56,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:08:56,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:56,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:08:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:56,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-10-16 14:08:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:56,080 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-10-16 14:08:56,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:08:56,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578927239] [2022-10-16 14:08:56,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578927239] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:08:56,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:08:56,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 14:08:56,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187488468] [2022-10-16 14:08:56,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:08:56,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 14:08:56,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:08:56,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 14:08:56,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-16 14:08:56,086 INFO L87 Difference]: Start difference. First operand 1130 states and 1450 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 14:08:57,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:08:57,939 INFO L93 Difference]: Finished difference Result 2646 states and 3505 transitions. [2022-10-16 14:08:57,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 14:08:57,940 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 95 [2022-10-16 14:08:57,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:08:57,969 INFO L225 Difference]: With dead ends: 2646 [2022-10-16 14:08:57,969 INFO L226 Difference]: Without dead ends: 2642 [2022-10-16 14:08:57,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-10-16 14:08:57,974 INFO L413 NwaCegarLoop]: 663 mSDtfsCounter, 1145 mSDsluCounter, 1151 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 516 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1222 SdHoareTripleChecker+Valid, 1814 SdHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 516 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-10-16 14:08:57,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1222 Valid, 1814 Invalid, 1311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [516 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-10-16 14:08:57,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2642 states. [2022-10-16 14:08:58,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2642 to 2220. [2022-10-16 14:08:58,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2220 states, 1718 states have (on average 1.2741559953434225) internal successors, (2189), 1761 states have internal predecessors, (2189), 343 states have call successors, (343), 133 states have call predecessors, (343), 133 states have return successors, (343), 339 states have call predecessors, (343), 343 states have call successors, (343) [2022-10-16 14:08:58,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2220 states to 2220 states and 2875 transitions. [2022-10-16 14:08:58,180 INFO L78 Accepts]: Start accepts. Automaton has 2220 states and 2875 transitions. Word has length 95 [2022-10-16 14:08:58,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:08:58,181 INFO L495 AbstractCegarLoop]: Abstraction has 2220 states and 2875 transitions. [2022-10-16 14:08:58,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 14:08:58,182 INFO L276 IsEmpty]: Start isEmpty. Operand 2220 states and 2875 transitions. [2022-10-16 14:08:58,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-10-16 14:08:58,186 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:08:58,187 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-10-16 14:08:58,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 14:08:58,187 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2022-10-16 14:08:58,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:08:58,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1564532975, now seen corresponding path program 1 times [2022-10-16 14:08:58,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:08:58,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368711584] [2022-10-16 14:08:58,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:08:58,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:08:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:58,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 14:08:58,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:58,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:08:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:58,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:08:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:58,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-16 14:08:58,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:58,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-16 14:08:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:58,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-10-16 14:08:58,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:58,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:08:58,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:58,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:08:58,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:58,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-10-16 14:08:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:58,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:08:58,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:58,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:08:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:58,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-10-16 14:08:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:58,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-10-16 14:08:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:08:58,733 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-10-16 14:08:58,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:08:58,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368711584] [2022-10-16 14:08:58,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368711584] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:08:58,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:08:58,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 14:08:58,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862585339] [2022-10-16 14:08:58,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:08:58,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 14:08:58,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:08:58,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 14:08:58,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-10-16 14:08:58,738 INFO L87 Difference]: Start difference. First operand 2220 states and 2875 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-10-16 14:09:01,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:09:01,410 INFO L93 Difference]: Finished difference Result 6340 states and 8404 transitions. [2022-10-16 14:09:01,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-16 14:09:01,411 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 112 [2022-10-16 14:09:01,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:09:01,467 INFO L225 Difference]: With dead ends: 6340 [2022-10-16 14:09:01,467 INFO L226 Difference]: Without dead ends: 5220 [2022-10-16 14:09:01,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-10-16 14:09:01,479 INFO L413 NwaCegarLoop]: 1151 mSDtfsCounter, 1087 mSDsluCounter, 2504 mSDsCounter, 0 mSdLazyCounter, 1344 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 3655 SdHoareTripleChecker+Invalid, 1778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 1344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-10-16 14:09:01,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1152 Valid, 3655 Invalid, 1778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 1344 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-10-16 14:09:01,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5220 states. [2022-10-16 14:09:01,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5220 to 2721. [2022-10-16 14:09:01,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2721 states, 2109 states have (on average 1.2688477951635846) internal successors, (2676), 2158 states have internal predecessors, (2676), 421 states have call successors, (421), 165 states have call predecessors, (421), 165 states have return successors, (421), 413 states have call predecessors, (421), 421 states have call successors, (421) [2022-10-16 14:09:01,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2721 states to 2721 states and 3518 transitions. [2022-10-16 14:09:01,773 INFO L78 Accepts]: Start accepts. Automaton has 2721 states and 3518 transitions. Word has length 112 [2022-10-16 14:09:01,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:09:01,774 INFO L495 AbstractCegarLoop]: Abstraction has 2721 states and 3518 transitions. [2022-10-16 14:09:01,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-10-16 14:09:01,775 INFO L276 IsEmpty]: Start isEmpty. Operand 2721 states and 3518 transitions. [2022-10-16 14:09:01,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-10-16 14:09:01,779 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:09:01,779 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:09:01,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 14:09:01,780 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2022-10-16 14:09:01,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:09:01,781 INFO L85 PathProgramCache]: Analyzing trace with hash -16147325, now seen corresponding path program 1 times [2022-10-16 14:09:01,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:09:01,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801059466] [2022-10-16 14:09:01,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:09:01,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:09:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:01,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 14:09:01,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:01,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:09:01,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:01,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:09:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:01,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-16 14:09:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:02,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-16 14:09:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:02,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-10-16 14:09:02,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:02,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:09:02,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:02,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:09:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:02,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-10-16 14:09:02,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:02,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:09:02,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:02,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:09:02,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:02,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-10-16 14:09:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:02,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-10-16 14:09:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:02,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:09:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:02,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-10-16 14:09:02,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:02,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-10-16 14:09:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:02,107 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-10-16 14:09:02,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:09:02,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801059466] [2022-10-16 14:09:02,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801059466] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:09:02,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:09:02,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 14:09:02,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175545011] [2022-10-16 14:09:02,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:09:02,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 14:09:02,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:09:02,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 14:09:02,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-10-16 14:09:02,111 INFO L87 Difference]: Start difference. First operand 2721 states and 3518 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-10-16 14:09:03,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:09:03,800 INFO L93 Difference]: Finished difference Result 6347 states and 8479 transitions. [2022-10-16 14:09:03,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 14:09:03,800 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 130 [2022-10-16 14:09:03,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:09:03,839 INFO L225 Difference]: With dead ends: 6347 [2022-10-16 14:09:03,839 INFO L226 Difference]: Without dead ends: 3640 [2022-10-16 14:09:03,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-10-16 14:09:03,855 INFO L413 NwaCegarLoop]: 609 mSDtfsCounter, 434 mSDsluCounter, 1492 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 2101 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-10-16 14:09:03,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 2101 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-10-16 14:09:03,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3640 states. [2022-10-16 14:09:04,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3640 to 2731. [2022-10-16 14:09:04,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2731 states, 2119 states have (on average 1.267579046720151) internal successors, (2686), 2168 states have internal predecessors, (2686), 421 states have call successors, (421), 165 states have call predecessors, (421), 165 states have return successors, (421), 413 states have call predecessors, (421), 421 states have call successors, (421) [2022-10-16 14:09:04,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2731 states to 2731 states and 3528 transitions. [2022-10-16 14:09:04,114 INFO L78 Accepts]: Start accepts. Automaton has 2731 states and 3528 transitions. Word has length 130 [2022-10-16 14:09:04,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:09:04,115 INFO L495 AbstractCegarLoop]: Abstraction has 2731 states and 3528 transitions. [2022-10-16 14:09:04,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-10-16 14:09:04,115 INFO L276 IsEmpty]: Start isEmpty. Operand 2731 states and 3528 transitions. [2022-10-16 14:09:04,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-10-16 14:09:04,119 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:09:04,120 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:09:04,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 14:09:04,120 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2022-10-16 14:09:04,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:09:04,121 INFO L85 PathProgramCache]: Analyzing trace with hash -525620415, now seen corresponding path program 1 times [2022-10-16 14:09:04,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:09:04,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927527782] [2022-10-16 14:09:04,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:09:04,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:09:04,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:04,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 14:09:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:04,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:09:04,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:04,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:09:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:04,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-16 14:09:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:04,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-16 14:09:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:04,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-10-16 14:09:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:04,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:09:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:04,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:09:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:04,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-10-16 14:09:04,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:04,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:09:04,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:04,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:09:04,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:04,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-10-16 14:09:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:04,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-10-16 14:09:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:04,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:09:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:04,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-10-16 14:09:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:04,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-10-16 14:09:04,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:04,416 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-10-16 14:09:04,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:09:04,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927527782] [2022-10-16 14:09:04,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927527782] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:09:04,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:09:04,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 14:09:04,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264809625] [2022-10-16 14:09:04,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:09:04,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 14:09:04,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:09:04,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 14:09:04,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-10-16 14:09:04,419 INFO L87 Difference]: Start difference. First operand 2731 states and 3528 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-10-16 14:09:05,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:09:05,830 INFO L93 Difference]: Finished difference Result 6342 states and 8425 transitions. [2022-10-16 14:09:05,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 14:09:05,831 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 130 [2022-10-16 14:09:05,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:09:05,868 INFO L225 Difference]: With dead ends: 6342 [2022-10-16 14:09:05,869 INFO L226 Difference]: Without dead ends: 3625 [2022-10-16 14:09:05,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-10-16 14:09:05,883 INFO L413 NwaCegarLoop]: 599 mSDtfsCounter, 538 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-10-16 14:09:05,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 1790 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-10-16 14:09:05,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3625 states. [2022-10-16 14:09:06,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3625 to 2736. [2022-10-16 14:09:06,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2736 states, 2124 states have (on average 1.2669491525423728) internal successors, (2691), 2173 states have internal predecessors, (2691), 421 states have call successors, (421), 165 states have call predecessors, (421), 165 states have return successors, (421), 413 states have call predecessors, (421), 421 states have call successors, (421) [2022-10-16 14:09:06,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2736 states to 2736 states and 3533 transitions. [2022-10-16 14:09:06,179 INFO L78 Accepts]: Start accepts. Automaton has 2736 states and 3533 transitions. Word has length 130 [2022-10-16 14:09:06,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:09:06,179 INFO L495 AbstractCegarLoop]: Abstraction has 2736 states and 3533 transitions. [2022-10-16 14:09:06,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-10-16 14:09:06,180 INFO L276 IsEmpty]: Start isEmpty. Operand 2736 states and 3533 transitions. [2022-10-16 14:09:06,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-10-16 14:09:06,184 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:09:06,184 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:09:06,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 14:09:06,185 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2022-10-16 14:09:06,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:09:06,186 INFO L85 PathProgramCache]: Analyzing trace with hash -744475133, now seen corresponding path program 1 times [2022-10-16 14:09:06,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:09:06,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485409426] [2022-10-16 14:09:06,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:09:06,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:09:06,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:06,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 14:09:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:06,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:09:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:06,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:09:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:06,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-16 14:09:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:06,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-16 14:09:06,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:06,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-10-16 14:09:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:06,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:09:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:06,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:09:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:06,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-10-16 14:09:06,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:06,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:09:06,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:06,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:09:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:06,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-10-16 14:09:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:06,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-10-16 14:09:06,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:06,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:09:06,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:06,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-10-16 14:09:06,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:06,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-10-16 14:09:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:06,581 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-10-16 14:09:06,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:09:06,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485409426] [2022-10-16 14:09:06,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485409426] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:09:06,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:09:06,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-16 14:09:06,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624596920] [2022-10-16 14:09:06,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:09:06,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 14:09:06,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:09:06,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 14:09:06,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-10-16 14:09:06,584 INFO L87 Difference]: Start difference. First operand 2736 states and 3533 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-10-16 14:09:08,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:09:08,503 INFO L93 Difference]: Finished difference Result 6377 states and 8465 transitions. [2022-10-16 14:09:08,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 14:09:08,504 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 130 [2022-10-16 14:09:08,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:09:08,538 INFO L225 Difference]: With dead ends: 6377 [2022-10-16 14:09:08,539 INFO L226 Difference]: Without dead ends: 3625 [2022-10-16 14:09:08,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-10-16 14:09:08,553 INFO L413 NwaCegarLoop]: 597 mSDtfsCounter, 369 mSDsluCounter, 2224 mSDsCounter, 0 mSdLazyCounter, 1241 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 2821 SdHoareTripleChecker+Invalid, 1496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 1241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-10-16 14:09:08,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 2821 Invalid, 1496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 1241 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-10-16 14:09:08,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3625 states. [2022-10-16 14:09:08,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3625 to 2736. [2022-10-16 14:09:08,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2736 states, 2124 states have (on average 1.262241054613936) internal successors, (2681), 2173 states have internal predecessors, (2681), 421 states have call successors, (421), 165 states have call predecessors, (421), 165 states have return successors, (421), 413 states have call predecessors, (421), 421 states have call successors, (421) [2022-10-16 14:09:08,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2736 states to 2736 states and 3523 transitions. [2022-10-16 14:09:08,844 INFO L78 Accepts]: Start accepts. Automaton has 2736 states and 3523 transitions. Word has length 130 [2022-10-16 14:09:08,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:09:08,844 INFO L495 AbstractCegarLoop]: Abstraction has 2736 states and 3523 transitions. [2022-10-16 14:09:08,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-10-16 14:09:08,845 INFO L276 IsEmpty]: Start isEmpty. Operand 2736 states and 3523 transitions. [2022-10-16 14:09:08,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-10-16 14:09:08,873 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:09:08,873 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:09:08,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 14:09:08,873 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2022-10-16 14:09:08,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:09:08,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1076615411, now seen corresponding path program 1 times [2022-10-16 14:09:08,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:09:08,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475326691] [2022-10-16 14:09:08,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:09:08,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:09:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:09,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 14:09:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:09,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:09:09,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:09,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:09:09,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:09,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-16 14:09:09,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:09,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-16 14:09:09,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:09,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-16 14:09:09,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:09,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:09:09,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:09,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:09:09,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:09,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-16 14:09:09,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:09,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:09:09,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:09,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:09:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:09,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-10-16 14:09:09,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:09,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-10-16 14:09:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:09,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:09:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:09,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-10-16 14:09:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:09,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-10-16 14:09:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:09,599 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-10-16 14:09:09,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:09:09,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475326691] [2022-10-16 14:09:09,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475326691] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:09:09,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:09:09,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-10-16 14:09:09,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245566676] [2022-10-16 14:09:09,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:09:09,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-16 14:09:09,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:09:09,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-16 14:09:09,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-10-16 14:09:09,604 INFO L87 Difference]: Start difference. First operand 2736 states and 3523 transitions. Second operand has 11 states, 10 states have (on average 7.6) internal successors, (76), 7 states have internal predecessors, (76), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-10-16 14:09:11,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:09:11,857 INFO L93 Difference]: Finished difference Result 6437 states and 8536 transitions. [2022-10-16 14:09:11,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-16 14:09:11,858 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.6) internal successors, (76), 7 states have internal predecessors, (76), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 131 [2022-10-16 14:09:11,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:09:11,898 INFO L225 Difference]: With dead ends: 6437 [2022-10-16 14:09:11,899 INFO L226 Difference]: Without dead ends: 3715 [2022-10-16 14:09:11,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2022-10-16 14:09:11,917 INFO L413 NwaCegarLoop]: 583 mSDtfsCounter, 598 mSDsluCounter, 2995 mSDsCounter, 0 mSdLazyCounter, 1554 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 3578 SdHoareTripleChecker+Invalid, 1988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 1554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-10-16 14:09:11,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 3578 Invalid, 1988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 1554 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-10-16 14:09:11,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3715 states. [2022-10-16 14:09:12,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3715 to 2826. [2022-10-16 14:09:12,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2826 states, 2189 states have (on average 1.2590223846505253) internal successors, (2756), 2248 states have internal predecessors, (2756), 431 states have call successors, (431), 170 states have call predecessors, (431), 180 states have return successors, (441), 423 states have call predecessors, (441), 431 states have call successors, (441) [2022-10-16 14:09:12,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2826 states to 2826 states and 3628 transitions. [2022-10-16 14:09:12,226 INFO L78 Accepts]: Start accepts. Automaton has 2826 states and 3628 transitions. Word has length 131 [2022-10-16 14:09:12,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:09:12,227 INFO L495 AbstractCegarLoop]: Abstraction has 2826 states and 3628 transitions. [2022-10-16 14:09:12,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.6) internal successors, (76), 7 states have internal predecessors, (76), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-10-16 14:09:12,227 INFO L276 IsEmpty]: Start isEmpty. Operand 2826 states and 3628 transitions. [2022-10-16 14:09:12,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-10-16 14:09:12,233 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:09:12,233 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:09:12,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-16 14:09:12,234 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2022-10-16 14:09:12,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:09:12,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1865982469, now seen corresponding path program 1 times [2022-10-16 14:09:12,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:09:12,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295414492] [2022-10-16 14:09:12,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:09:12,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:09:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:13,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 14:09:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:13,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:09:13,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:13,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:09:13,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:13,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-16 14:09:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:13,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-16 14:09:13,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:13,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-16 14:09:13,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:13,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:09:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:13,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:09:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:13,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-16 14:09:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:13,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:09:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:13,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:09:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:13,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-10-16 14:09:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:13,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-10-16 14:09:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:13,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:09:13,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:13,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-10-16 14:09:13,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:13,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-10-16 14:09:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:13,220 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-10-16 14:09:13,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:09:13,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295414492] [2022-10-16 14:09:13,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295414492] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:09:13,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:09:13,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-10-16 14:09:13,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24580842] [2022-10-16 14:09:13,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:09:13,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-16 14:09:13,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:09:13,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-16 14:09:13,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-10-16 14:09:13,224 INFO L87 Difference]: Start difference. First operand 2826 states and 3628 transitions. Second operand has 11 states, 11 states have (on average 7.0) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2022-10-16 14:09:15,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:09:15,957 INFO L93 Difference]: Finished difference Result 7946 states and 10682 transitions. [2022-10-16 14:09:15,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-16 14:09:15,957 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 132 [2022-10-16 14:09:15,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:09:15,997 INFO L225 Difference]: With dead ends: 7946 [2022-10-16 14:09:15,998 INFO L226 Difference]: Without dead ends: 5134 [2022-10-16 14:09:16,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-10-16 14:09:16,015 INFO L413 NwaCegarLoop]: 755 mSDtfsCounter, 1009 mSDsluCounter, 4050 mSDsCounter, 0 mSdLazyCounter, 1901 mSolverCounterSat, 362 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 4805 SdHoareTripleChecker+Invalid, 2263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 362 IncrementalHoareTripleChecker+Valid, 1901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-10-16 14:09:16,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1037 Valid, 4805 Invalid, 2263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [362 Valid, 1901 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-10-16 14:09:16,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5134 states. [2022-10-16 14:09:16,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5134 to 2852. [2022-10-16 14:09:16,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2852 states, 2210 states have (on average 1.2565610859728507) internal successors, (2777), 2270 states have internal predecessors, (2777), 431 states have call successors, (431), 170 states have call predecessors, (431), 185 states have return successors, (486), 427 states have call predecessors, (486), 431 states have call successors, (486) [2022-10-16 14:09:16,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3694 transitions. [2022-10-16 14:09:16,476 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3694 transitions. Word has length 132 [2022-10-16 14:09:16,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:09:16,477 INFO L495 AbstractCegarLoop]: Abstraction has 2852 states and 3694 transitions. [2022-10-16 14:09:16,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2022-10-16 14:09:16,478 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3694 transitions. [2022-10-16 14:09:16,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-10-16 14:09:16,484 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:09:16,484 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:09:16,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-16 14:09:16,485 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2022-10-16 14:09:16,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:09:16,485 INFO L85 PathProgramCache]: Analyzing trace with hash -2059148966, now seen corresponding path program 1 times [2022-10-16 14:09:16,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:09:16,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861253991] [2022-10-16 14:09:16,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:09:16,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:09:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:17,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 14:09:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:17,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:09:17,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:17,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:09:17,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:17,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-16 14:09:17,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:17,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-16 14:09:17,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:17,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-16 14:09:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:17,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:09:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:17,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:09:17,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:17,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-16 14:09:17,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:17,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:09:17,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:17,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:09:17,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:17,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-10-16 14:09:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:17,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-10-16 14:09:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:17,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:09:17,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:17,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-10-16 14:09:17,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:17,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 14:09:17,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:17,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-10-16 14:09:17,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:17,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:09:17,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:17,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 14:09:17,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:17,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-10-16 14:09:17,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:17,453 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-10-16 14:09:17,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:09:17,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861253991] [2022-10-16 14:09:17,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861253991] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:09:17,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013217417] [2022-10-16 14:09:17,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:09:17,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:09:17,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:09:17,457 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 14:09:17,464 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 14:09:18,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:18,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 1439 conjuncts, 11 conjunts are in the unsatisfiable core [2022-10-16 14:09:18,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:09:18,395 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-10-16 14:09:18,395 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 14:09:18,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013217417] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:09:18,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 14:09:18,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2022-10-16 14:09:18,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114588088] [2022-10-16 14:09:18,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:09:18,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 14:09:18,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:09:18,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 14:09:18,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-10-16 14:09:18,405 INFO L87 Difference]: Start difference. First operand 2852 states and 3694 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-10-16 14:09:18,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:09:18,816 INFO L93 Difference]: Finished difference Result 5702 states and 7386 transitions. [2022-10-16 14:09:18,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 14:09:18,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 153 [2022-10-16 14:09:18,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:09:18,832 INFO L225 Difference]: With dead ends: 5702 [2022-10-16 14:09:18,833 INFO L226 Difference]: Without dead ends: 2853 [2022-10-16 14:09:18,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-10-16 14:09:18,846 INFO L413 NwaCegarLoop]: 630 mSDtfsCounter, 3 mSDsluCounter, 1255 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1885 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 14:09:18,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1885 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 14:09:18,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2853 states. [2022-10-16 14:09:19,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2853 to 2853. [2022-10-16 14:09:19,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2853 states, 2211 states have (on average 1.2564450474898237) internal successors, (2778), 2271 states have internal predecessors, (2778), 431 states have call successors, (431), 170 states have call predecessors, (431), 185 states have return successors, (486), 427 states have call predecessors, (486), 431 states have call successors, (486) [2022-10-16 14:09:19,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2853 states and 3695 transitions. [2022-10-16 14:09:19,163 INFO L78 Accepts]: Start accepts. Automaton has 2853 states and 3695 transitions. Word has length 153 [2022-10-16 14:09:19,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:09:19,163 INFO L495 AbstractCegarLoop]: Abstraction has 2853 states and 3695 transitions. [2022-10-16 14:09:19,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-10-16 14:09:19,164 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 3695 transitions. [2022-10-16 14:09:19,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-10-16 14:09:19,169 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:09:19,170 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:09:19,222 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 14:09:19,383 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,SelfDestructingSolverStorable10 [2022-10-16 14:09:19,384 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2022-10-16 14:09:19,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:09:19,385 INFO L85 PathProgramCache]: Analyzing trace with hash -437111150, now seen corresponding path program 1 times [2022-10-16 14:09:19,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:09:19,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280508193] [2022-10-16 14:09:19,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:09:19,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:09:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:20,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 14:09:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:20,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:09:20,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:20,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:09:20,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:20,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-16 14:09:20,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:20,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-10-16 14:09:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:20,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-10-16 14:09:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:20,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:09:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:20,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:09:20,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:20,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 14:09:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:20,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:09:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:20,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:09:20,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:20,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-10-16 14:09:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:20,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-10-16 14:09:20,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:20,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:09:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:20,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-10-16 14:09:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:20,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 14:09:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:20,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-10-16 14:09:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:20,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:09:20,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:20,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 14:09:20,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:20,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-10-16 14:09:20,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:20,449 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-10-16 14:09:20,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:09:20,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280508193] [2022-10-16 14:09:20,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280508193] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:09:20,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926812754] [2022-10-16 14:09:20,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:09:20,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:09:20,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:09:20,452 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 14:09:20,474 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 14:09:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:21,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 1469 conjuncts, 16 conjunts are in the unsatisfiable core [2022-10-16 14:09:21,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:09:21,192 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 44 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-10-16 14:09:21,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 14:09:21,404 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-10-16 14:09:21,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926812754] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 14:09:21,405 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 14:09:21,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2022-10-16 14:09:21,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142090926] [2022-10-16 14:09:21,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 14:09:21,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-16 14:09:21,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:09:21,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-16 14:09:21,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-10-16 14:09:21,408 INFO L87 Difference]: Start difference. First operand 2853 states and 3695 transitions. Second operand has 14 states, 14 states have (on average 10.214285714285714) internal successors, (143), 10 states have internal predecessors, (143), 2 states have call successors, (37), 6 states have call predecessors, (37), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2022-10-16 14:09:24,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:09:24,505 INFO L93 Difference]: Finished difference Result 6593 states and 8728 transitions. [2022-10-16 14:09:24,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-16 14:09:24,506 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 10.214285714285714) internal successors, (143), 10 states have internal predecessors, (143), 2 states have call successors, (37), 6 states have call predecessors, (37), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 155 [2022-10-16 14:09:24,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:09:24,534 INFO L225 Difference]: With dead ends: 6593 [2022-10-16 14:09:24,534 INFO L226 Difference]: Without dead ends: 3743 [2022-10-16 14:09:24,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=193, Invalid=509, Unknown=0, NotChecked=0, Total=702 [2022-10-16 14:09:24,549 INFO L413 NwaCegarLoop]: 596 mSDtfsCounter, 663 mSDsluCounter, 2971 mSDsCounter, 0 mSdLazyCounter, 1528 mSolverCounterSat, 537 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 3567 SdHoareTripleChecker+Invalid, 2065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 537 IncrementalHoareTripleChecker+Valid, 1528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-10-16 14:09:24,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 3567 Invalid, 2065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [537 Valid, 1528 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-10-16 14:09:24,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3743 states. [2022-10-16 14:09:24,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3743 to 2863. [2022-10-16 14:09:24,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2863 states, 2220 states have (on average 1.2567567567567568) internal successors, (2790), 2280 states have internal predecessors, (2790), 431 states have call successors, (431), 171 states have call predecessors, (431), 186 states have return successors, (486), 427 states have call predecessors, (486), 431 states have call successors, (486) [2022-10-16 14:09:24,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2863 states to 2863 states and 3707 transitions. [2022-10-16 14:09:24,885 INFO L78 Accepts]: Start accepts. Automaton has 2863 states and 3707 transitions. Word has length 155 [2022-10-16 14:09:24,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:09:24,886 INFO L495 AbstractCegarLoop]: Abstraction has 2863 states and 3707 transitions. [2022-10-16 14:09:24,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.214285714285714) internal successors, (143), 10 states have internal predecessors, (143), 2 states have call successors, (37), 6 states have call predecessors, (37), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2022-10-16 14:09:24,887 INFO L276 IsEmpty]: Start isEmpty. Operand 2863 states and 3707 transitions. [2022-10-16 14:09:24,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-10-16 14:09:24,893 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:09:24,893 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:09:24,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-10-16 14:09:25,108 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,SelfDestructingSolverStorable11 [2022-10-16 14:09:25,110 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2022-10-16 14:09:25,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:09:25,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1444431770, now seen corresponding path program 2 times [2022-10-16 14:09:25,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:09:25,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146677599] [2022-10-16 14:09:25,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:09:25,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:09:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:26,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 14:09:26,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:26,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:09:26,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:26,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:09:26,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:26,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-16 14:09:26,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:26,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-10-16 14:09:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:26,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-16 14:09:26,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:26,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:09:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:26,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:09:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:26,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-16 14:09:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:26,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:09:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:26,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:09:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:26,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-10-16 14:09:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:26,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-10-16 14:09:26,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:26,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:09:26,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:26,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-10-16 14:09:26,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:26,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 14:09:26,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:26,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-10-16 14:09:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:26,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:09:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:26,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 14:09:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:26,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-10-16 14:09:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:26,571 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-10-16 14:09:26,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:09:26,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146677599] [2022-10-16 14:09:26,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146677599] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:09:26,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119284323] [2022-10-16 14:09:26,572 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 14:09:26,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:09:26,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:09:26,574 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 14:09:26,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-16 14:09:27,282 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 14:09:27,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 14:09:27,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 1529 conjuncts, 25 conjunts are in the unsatisfiable core [2022-10-16 14:09:27,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:09:27,585 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 42 proven. 25 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-10-16 14:09:27,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 14:09:27,897 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-10-16 14:09:27,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119284323] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 14:09:27,897 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 14:09:27,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 6] total 25 [2022-10-16 14:09:27,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519789332] [2022-10-16 14:09:27,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 14:09:27,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-10-16 14:09:27,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:09:27,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-10-16 14:09:27,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2022-10-16 14:09:27,900 INFO L87 Difference]: Start difference. First operand 2863 states and 3707 transitions. Second operand has 25 states, 25 states have (on average 6.08) internal successors, (152), 21 states have internal predecessors, (152), 2 states have call successors, (36), 6 states have call predecessors, (36), 5 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2022-10-16 14:09:32,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:09:32,832 INFO L93 Difference]: Finished difference Result 6602 states and 8735 transitions. [2022-10-16 14:09:32,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-10-16 14:09:32,833 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 6.08) internal successors, (152), 21 states have internal predecessors, (152), 2 states have call successors, (36), 6 states have call predecessors, (36), 5 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 159 [2022-10-16 14:09:32,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:09:32,855 INFO L225 Difference]: With dead ends: 6602 [2022-10-16 14:09:32,856 INFO L226 Difference]: Without dead ends: 3741 [2022-10-16 14:09:32,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=311, Invalid=1495, Unknown=0, NotChecked=0, Total=1806 [2022-10-16 14:09:32,872 INFO L413 NwaCegarLoop]: 600 mSDtfsCounter, 499 mSDsluCounter, 7265 mSDsCounter, 0 mSdLazyCounter, 3882 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 7865 SdHoareTripleChecker+Invalid, 4198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 3882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-10-16 14:09:32,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 7865 Invalid, 4198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 3882 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-10-16 14:09:32,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3741 states. [2022-10-16 14:09:33,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3741 to 2866. [2022-10-16 14:09:33,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2866 states, 2223 states have (on average 1.2550607287449393) internal successors, (2790), 2283 states have internal predecessors, (2790), 431 states have call successors, (431), 171 states have call predecessors, (431), 186 states have return successors, (486), 427 states have call predecessors, (486), 431 states have call successors, (486) [2022-10-16 14:09:33,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2866 states to 2866 states and 3707 transitions. [2022-10-16 14:09:33,278 INFO L78 Accepts]: Start accepts. Automaton has 2866 states and 3707 transitions. Word has length 159 [2022-10-16 14:09:33,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:09:33,279 INFO L495 AbstractCegarLoop]: Abstraction has 2866 states and 3707 transitions. [2022-10-16 14:09:33,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 6.08) internal successors, (152), 21 states have internal predecessors, (152), 2 states have call successors, (36), 6 states have call predecessors, (36), 5 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2022-10-16 14:09:33,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2866 states and 3707 transitions. [2022-10-16 14:09:33,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-10-16 14:09:33,285 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:09:33,285 INFO L195 NwaCegarLoop]: trace histogram [9, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:09:33,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-16 14:09:33,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:09:33,499 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2022-10-16 14:09:33,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:09:33,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1223921896, now seen corresponding path program 3 times [2022-10-16 14:09:33,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:09:33,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751603908] [2022-10-16 14:09:33,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:09:33,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:09:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:34,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 14:09:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:34,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:09:34,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:34,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:09:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:34,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-16 14:09:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:34,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-10-16 14:09:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:34,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-10-16 14:09:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:34,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:09:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:34,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:09:34,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:34,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-10-16 14:09:34,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:34,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:09:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:34,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:09:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:34,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-10-16 14:09:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:34,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-10-16 14:09:34,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:34,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:09:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:34,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-10-16 14:09:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:34,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 14:09:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:34,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-10-16 14:09:34,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:34,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:09:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:34,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 14:09:34,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:34,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-10-16 14:09:34,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:09:34,777 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-10-16 14:09:34,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:09:34,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751603908] [2022-10-16 14:09:34,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751603908] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:09:34,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046142146] [2022-10-16 14:09:34,779 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 14:09:34,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:09:34,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:09:34,783 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 14:09:34,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-16 14:09:46,912 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-10-16 14:09:46,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 14:09:46,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 1574 conjuncts, 48 conjunts are in the unsatisfiable core [2022-10-16 14:09:46,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:09:47,193 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 70 proven. 15 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-10-16 14:09:47,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 14:09:47,680 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-10-16 14:09:47,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046142146] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 14:09:47,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 14:09:47,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 27 [2022-10-16 14:09:47,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899626068] [2022-10-16 14:09:47,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 14:09:47,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-10-16 14:09:47,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:09:47,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-10-16 14:09:47,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2022-10-16 14:09:47,684 INFO L87 Difference]: Start difference. First operand 2866 states and 3707 transitions. Second operand has 27 states, 27 states have (on average 5.851851851851852) internal successors, (158), 23 states have internal predecessors, (158), 3 states have call successors, (39), 6 states have call predecessors, (39), 4 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2022-10-16 14:09:53,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:09:53,731 INFO L93 Difference]: Finished difference Result 6607 states and 8739 transitions. [2022-10-16 14:09:53,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-10-16 14:09:53,732 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 5.851851851851852) internal successors, (158), 23 states have internal predecessors, (158), 3 states have call successors, (39), 6 states have call predecessors, (39), 4 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) Word has length 162 [2022-10-16 14:09:53,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:09:53,756 INFO L225 Difference]: With dead ends: 6607 [2022-10-16 14:09:53,756 INFO L226 Difference]: Without dead ends: 3751 [2022-10-16 14:09:53,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=512, Invalid=1840, Unknown=0, NotChecked=0, Total=2352 [2022-10-16 14:09:53,770 INFO L413 NwaCegarLoop]: 597 mSDtfsCounter, 882 mSDsluCounter, 4103 mSDsCounter, 0 mSdLazyCounter, 2361 mSolverCounterSat, 460 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 961 SdHoareTripleChecker+Valid, 4700 SdHoareTripleChecker+Invalid, 2821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 460 IncrementalHoareTripleChecker+Valid, 2361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-10-16 14:09:53,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [961 Valid, 4700 Invalid, 2821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [460 Valid, 2361 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-10-16 14:09:53,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3751 states. [2022-10-16 14:09:54,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3751 to 2873. [2022-10-16 14:09:54,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2873 states, 2230 states have (on average 1.2547085201793722) internal successors, (2798), 2290 states have internal predecessors, (2798), 431 states have call successors, (431), 171 states have call predecessors, (431), 186 states have return successors, (486), 427 states have call predecessors, (486), 431 states have call successors, (486) [2022-10-16 14:09:54,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2873 states to 2873 states and 3715 transitions. [2022-10-16 14:09:54,109 INFO L78 Accepts]: Start accepts. Automaton has 2873 states and 3715 transitions. Word has length 162 [2022-10-16 14:09:54,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:09:54,109 INFO L495 AbstractCegarLoop]: Abstraction has 2873 states and 3715 transitions. [2022-10-16 14:09:54,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.851851851851852) internal successors, (158), 23 states have internal predecessors, (158), 3 states have call successors, (39), 6 states have call predecessors, (39), 4 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2022-10-16 14:09:54,110 INFO L276 IsEmpty]: Start isEmpty. Operand 2873 states and 3715 transitions. [2022-10-16 14:09:54,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-10-16 14:09:54,115 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:09:54,115 INFO L195 NwaCegarLoop]: trace histogram [12, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:09:54,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-16 14:09:54,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:09:54,316 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2022-10-16 14:09:54,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:09:54,318 INFO L85 PathProgramCache]: Analyzing trace with hash -861504038, now seen corresponding path program 4 times [2022-10-16 14:09:54,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:09:54,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675069679] [2022-10-16 14:09:54,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:09:54,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:09:54,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 14:09:54,794 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-16 14:09:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 14:09:55,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-16 14:09:55,352 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-16 14:09:55,353 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 32 remaining) [2022-10-16 14:09:55,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 32 remaining) [2022-10-16 14:09:55,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 32 remaining) [2022-10-16 14:09:55,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location index_to_minorErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 32 remaining) [2022-10-16 14:09:55,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location index_to_minorErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 32 remaining) [2022-10-16 14:09:55,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 32 remaining) [2022-10-16 14:09:55,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 32 remaining) [2022-10-16 14:09:55,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 32 remaining) [2022-10-16 14:09:55,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 32 remaining) [2022-10-16 14:09:55,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 32 remaining) [2022-10-16 14:09:55,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 32 remaining) [2022-10-16 14:09:55,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 32 remaining) [2022-10-16 14:09:55,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 32 remaining) [2022-10-16 14:09:55,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 32 remaining) [2022-10-16 14:09:55,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 32 remaining) [2022-10-16 14:09:55,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 32 remaining) [2022-10-16 14:09:55,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 32 remaining) [2022-10-16 14:09:55,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 32 remaining) [2022-10-16 14:09:55,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 32 remaining) [2022-10-16 14:09:55,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 32 remaining) [2022-10-16 14:09:55,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 32 remaining) [2022-10-16 14:09:55,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 32 remaining) [2022-10-16 14:09:55,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 32 remaining) [2022-10-16 14:09:55,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 32 remaining) [2022-10-16 14:09:55,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 32 remaining) [2022-10-16 14:09:55,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 32 remaining) [2022-10-16 14:09:55,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 32 remaining) [2022-10-16 14:09:55,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 32 remaining) [2022-10-16 14:09:55,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 32 remaining) [2022-10-16 14:09:55,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 32 remaining) [2022-10-16 14:09:55,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 32 remaining) [2022-10-16 14:09:55,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 32 remaining) [2022-10-16 14:09:55,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-16 14:09:55,367 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:09:55,372 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 14:09:55,402 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-16 14:09:55,406 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-16 14:09:55,406 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-16 14:09:55,407 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-16 14:09:55,407 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-16 14:09:55,407 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-16 14:09:55,408 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-16 14:09:55,408 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-16 14:09:55,408 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-16 14:09:55,409 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-16 14:09:55,412 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-16 14:09:55,412 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-16 14:09:55,413 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-16 14:09:55,413 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-16 14:09:55,413 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-16 14:09:55,414 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-16 14:09:55,414 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-16 14:09:55,414 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-16 14:09:55,414 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-16 14:09:55,417 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-16 14:09:55,417 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-16 14:09:55,418 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-16 14:09:55,418 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-16 14:09:55,418 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-16 14:09:55,418 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-16 14:09:55,418 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-16 14:09:55,419 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-16 14:09:55,419 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-16 14:09:55,419 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-16 14:09:55,419 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-16 14:09:55,423 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-16 14:09:55,423 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-16 14:09:55,423 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-16 14:09:55,424 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-16 14:09:55,424 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-16 14:09:55,424 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-16 14:09:55,424 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-16 14:09:55,424 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-16 14:09:55,425 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-16 14:09:55,425 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-16 14:09:55,425 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-16 14:09:55,425 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-16 14:09:55,425 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-16 14:09:55,426 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-16 14:09:55,426 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-16 14:09:55,426 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-16 14:09:55,426 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-16 14:09:55,426 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-16 14:09:55,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 02:09:55 BoogieIcfgContainer [2022-10-16 14:09:55,576 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 14:09:55,577 INFO L158 Benchmark]: Toolchain (without parser) took 71776.80ms. Allocated memory was 151.0MB in the beginning and 694.2MB in the end (delta: 543.2MB). Free memory was 119.3MB in the beginning and 553.4MB in the end (delta: -434.1MB). Peak memory consumption was 438.8MB. Max. memory is 8.0GB. [2022-10-16 14:09:55,577 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 151.0MB. Free memory is still 121.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 14:09:55,578 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1856.87ms. Allocated memory is still 151.0MB. Free memory was 119.0MB in the beginning and 55.2MB in the end (delta: 63.8MB). Peak memory consumption was 63.6MB. Max. memory is 8.0GB. [2022-10-16 14:09:55,578 INFO L158 Benchmark]: Boogie Procedure Inliner took 270.34ms. Allocated memory is still 151.0MB. Free memory was 55.2MB in the beginning and 113.3MB in the end (delta: -58.1MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-10-16 14:09:55,578 INFO L158 Benchmark]: Boogie Preprocessor took 267.24ms. Allocated memory was 151.0MB in the beginning and 204.5MB in the end (delta: 53.5MB). Free memory was 113.3MB in the beginning and 157.2MB in the end (delta: -43.8MB). Peak memory consumption was 19.5MB. Max. memory is 8.0GB. [2022-10-16 14:09:55,579 INFO L158 Benchmark]: RCFGBuilder took 2441.01ms. Allocated memory is still 204.5MB. Free memory was 157.2MB in the beginning and 116.2MB in the end (delta: 41.0MB). Peak memory consumption was 54.2MB. Max. memory is 8.0GB. [2022-10-16 14:09:55,579 INFO L158 Benchmark]: TraceAbstraction took 66928.62ms. Allocated memory was 204.5MB in the beginning and 694.2MB in the end (delta: 489.7MB). Free memory was 115.7MB in the beginning and 553.4MB in the end (delta: -437.8MB). Peak memory consumption was 380.1MB. Max. memory is 8.0GB. [2022-10-16 14:09:55,581 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.31ms. Allocated memory is still 151.0MB. Free memory is still 121.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1856.87ms. Allocated memory is still 151.0MB. Free memory was 119.0MB in the beginning and 55.2MB in the end (delta: 63.8MB). Peak memory consumption was 63.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 270.34ms. Allocated memory is still 151.0MB. Free memory was 55.2MB in the beginning and 113.3MB in the end (delta: -58.1MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 267.24ms. Allocated memory was 151.0MB in the beginning and 204.5MB in the end (delta: 53.5MB). Free memory was 113.3MB in the beginning and 157.2MB in the end (delta: -43.8MB). Peak memory consumption was 19.5MB. Max. memory is 8.0GB. * RCFGBuilder took 2441.01ms. Allocated memory is still 204.5MB. Free memory was 157.2MB in the beginning and 116.2MB in the end (delta: 41.0MB). Peak memory consumption was 54.2MB. Max. memory is 8.0GB. * TraceAbstraction took 66928.62ms. Allocated memory was 204.5MB in the beginning and 694.2MB in the end (delta: 489.7MB). Free memory was 115.7MB in the beginning and 553.4MB in the end (delta: -437.8MB). Peak memory consumption was 380.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled * 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 - UnprovableResult [Line: 4248]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 4030. Possible FailurePath: [L3355] int LDV_IN_INTERRUPT = 1; [L3356] struct block_device *virtblk_fops_group0 ; [L3357] int ldv_state_variable_2 ; [L3358] int ref_cnt ; [L3359] int ldv_state_variable_1 ; [L3360] struct virtio_device *virtio_blk_group0 ; [L3361] int ldv_state_variable_0 ; [L3492] static int major ; [L3493] static int index ; [L3818-L3819] static struct block_device_operations const virtblk_fops = {0, 0, & virtblk_ioctl, 0, 0, 0, 0, 0, 0, & virtblk_getgeo, 0, & __this_module}; [L4018-L4019] static struct virtio_device_id const id_table[2U] = { {2U, 4294967295U}, {0U, 0U}}; [L4020-L4023] static unsigned int features[9U] = { 0U, 2U, 1U, 4U, 5U, 6U, 7U, 9U, 10U}; [L4024-L4025] static struct virtio_driver virtio_blk = {{"virtio_blk", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0}, (struct virtio_device_id const *)(& id_table), (unsigned int const *)(& features), 9U, & virtblk_probe, & virtblk_remove, 0}; [L4047] struct virtio_device_id const __mod_virtio_device_table ; [L4048] int ldv_retval_0 ; [L4049] int ldv_retval_1 ; [L4283] int ldv_blk_rq = 0; VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4072] unsigned long ldvarg1 ; [L4073] fmode_t ldvarg3 ; [L4074] struct hd_geometry *ldvarg0 ; [L4075] void *tmp ; [L4076] unsigned int ldvarg2 ; [L4077] int tmp___0 ; [L4078] int tmp___1 ; [L4079] int tmp___2 ; [L4080] int tmp___3 ; VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg1={4294967303:0}, ldvarg3={4294967302:0}, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4082] CALL, EXPR ldv_init_zalloc(16UL) VAL [\old(size)=16, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3290] void *p ; [L3291] void *tmp ; [L3293] EXPR, FCALL calloc(1UL, size) VAL [\old(size)=16, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, calloc(1UL, size)={-4294967297:0}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, major=0, ref_cnt=0, size=16, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3293] tmp = calloc(1UL, size) [L3294] p = tmp VAL [\old(size)=16, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, calloc(1UL, size)={-4294967297:0}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, major=0, p={-4294967297:0}, ref_cnt=0, size=16, tmp={-4294967297:0}, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3295] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(cond)=1, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3249] COND FALSE !(!cond) VAL [\old(cond)=1, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, cond=1, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3295] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(size)=16, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, calloc(1UL, size)={-4294967297:0}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, major=0, p={-4294967297:0}, ref_cnt=0, size=16, tmp={-4294967297:0}, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3296] return (p); VAL [\old(size)=16, \result={-4294967297:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, calloc(1UL, size)={-4294967297:0}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, major=0, p={-4294967297:0}, ref_cnt=0, size=16, tmp={-4294967297:0}, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4082] RET, EXPR ldv_init_zalloc(16UL) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_init_zalloc(16UL)={-4294967297:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg1={4294967303:0}, ldvarg3={4294967302:0}, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4082] tmp = ldv_init_zalloc(16UL) [L4083] ldvarg0 = (struct hd_geometry *)tmp [L4084] FCALL ldv_initialize() [L4085] CALL ldv_memset((void *)(& ldvarg1), 0, 8UL) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3301] void *tmp ; [L3303] EXPR, FCALL memset(s, c, n) [L3303] tmp = memset(s, c, n) [L3304] return (tmp); VAL [\old(c)=0, \old(n)=8, \result={4294967303:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, c=0, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, major=0, n=8, ref_cnt=0, s={4294967303:0}, s={4294967303:0}, tmp={4294967303:0}, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4085] RET ldv_memset((void *)(& ldvarg1), 0, 8UL) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_memset((void *)(& ldvarg1), 0, 8UL)={4294967303:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={-4294967297:0}, ldvarg1={4294967303:0}, ldvarg3={4294967302:0}, major=0, ref_cnt=0, tmp={-4294967297:0}, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4086] CALL ldv_memset((void *)(& ldvarg3), 0, 4UL) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3301] void *tmp ; [L3303] EXPR, FCALL memset(s, c, n) [L3303] tmp = memset(s, c, n) [L3304] return (tmp); VAL [\old(c)=0, \old(n)=4, \result={4294967302:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, c=0, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, major=0, n=4, ref_cnt=0, s={4294967302:0}, s={4294967302:0}, tmp={4294967302:0}, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4086] RET ldv_memset((void *)(& ldvarg3), 0, 4UL) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_memset((void *)(& ldvarg3), 0, 4UL)={4294967302:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={-4294967297:0}, ldvarg1={4294967303:0}, ldvarg3={4294967302:0}, major=0, ref_cnt=0, tmp={-4294967297:0}, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4087] ldvarg2 = __VERIFIER_nondet_ulong () [L4088] ldv_state_variable_1 = 0 [L4089] ref_cnt = 0 [L4090] ldv_state_variable_0 = 1 [L4091] ldv_state_variable_2 = 0 VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={-4294967297:0}, ldvarg1={4294967303:0}, ldvarg2=46, ldvarg3={4294967302:0}, major=0, ref_cnt=0, tmp={-4294967297:0}, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4093] tmp___0 = __VERIFIER_nondet_int() [L4095] case 0: [L4125] case 1: VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={-4294967297:0}, ldvarg1={4294967303:0}, ldvarg2=46, ldvarg3={4294967302:0}, major=0, ref_cnt=0, tmp={-4294967297:0}, tmp___0=1, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4126] COND TRUE ldv_state_variable_0 != 0 [L4127] tmp___2 = __VERIFIER_nondet_int() [L4129] case 0: [L4137] case 1: VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={-4294967297:0}, ldvarg1={4294967303:0}, ldvarg2=46, ldvarg3={4294967302:0}, major=0, ref_cnt=0, tmp={-4294967297:0}, tmp___0=1, tmp___2=1, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4138] COND TRUE ldv_state_variable_0 == 1 [L4139] CALL, EXPR init() [L4028] int tmp ; [L4030] CALL, EXPR register_blkdev(0U, "virtblk") [L4472] return __VERIFIER_nondet_int(); [L4030] RET, EXPR register_blkdev(0U, "virtblk") [L4030] major = register_blkdev(0U, "virtblk") [L4031] COND FALSE !(major < 0) [L4035] CALL, EXPR register_virtio_driver(& virtio_blk) [L4476] return __VERIFIER_nondet_int(); [L4035] RET, EXPR register_virtio_driver(& virtio_blk) [L4035] tmp = register_virtio_driver(& virtio_blk) [L4036] return (tmp); VAL [\result=0, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, major=0, ref_cnt=0, tmp=0, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4139] RET, EXPR init() [L4139] ldv_retval_1 = init() [L4140] COND TRUE ldv_retval_1 == 0 [L4141] ldv_state_variable_0 = 3 [L4142] ldv_state_variable_2 = 1 [L4143] CALL ldv_initialize_block_device_operations_2() [L4063] void *tmp ; VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=0, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4065] CALL, EXPR ldv_init_zalloc(464UL) VAL [\old(size)=464, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=0, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3290] void *p ; [L3291] void *tmp ; [L3293] EXPR, FCALL calloc(1UL, size) VAL [\old(size)=464, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, calloc(1UL, size)={4294967297:0}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=0, ldv_state_variable_2=1, major=0, ref_cnt=0, size=464, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3293] tmp = calloc(1UL, size) [L3294] p = tmp VAL [\old(size)=464, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, calloc(1UL, size)={4294967297:0}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=0, ldv_state_variable_2=1, major=0, p={4294967297:0}, ref_cnt=0, size=464, tmp={4294967297:0}, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3295] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(cond)=1, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=0, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3249] COND FALSE !(!cond) VAL [\old(cond)=1, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, cond=1, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=0, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3295] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(size)=464, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, calloc(1UL, size)={4294967297:0}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=0, ldv_state_variable_2=1, major=0, p={4294967297:0}, ref_cnt=0, size=464, tmp={4294967297:0}, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3296] return (p); VAL [\old(size)=464, \result={4294967297:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, calloc(1UL, size)={4294967297:0}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=0, ldv_state_variable_2=1, major=0, p={4294967297:0}, ref_cnt=0, size=464, tmp={4294967297:0}, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4065] RET, EXPR ldv_init_zalloc(464UL) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_init_zalloc(464UL)={4294967297:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=0, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4065] tmp = ldv_init_zalloc(464UL) [L4066] virtblk_fops_group0 = (struct block_device *)tmp VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=0, ldv_state_variable_2=1, major=0, ref_cnt=0, tmp={4294967297:0}, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4143] RET ldv_initialize_block_device_operations_2() [L4144] ldv_state_variable_1 = 1 [L4145] CALL ldv_initialize_virtio_driver_1() [L4054] void *tmp ; VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4056] CALL, EXPR ldv_init_zalloc(1048UL) VAL [\old(size)=1048, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3290] void *p ; [L3291] void *tmp ; [L3293] EXPR, FCALL calloc(1UL, size) VAL [\old(size)=1048, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, calloc(1UL, size)={-8589934593:0}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, size=1048, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3293] tmp = calloc(1UL, size) [L3294] p = tmp VAL [\old(size)=1048, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, calloc(1UL, size)={-8589934593:0}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, p={-8589934593:0}, ref_cnt=0, size=1048, tmp={-8589934593:0}, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3295] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(cond)=1, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3249] COND FALSE !(!cond) VAL [\old(cond)=1, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, cond=1, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3295] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(size)=1048, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, calloc(1UL, size)={-8589934593:0}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, p={-8589934593:0}, ref_cnt=0, size=1048, tmp={-8589934593:0}, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3296] return (p); VAL [\old(size)=1048, \result={-8589934593:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, calloc(1UL, size)={-8589934593:0}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, p={-8589934593:0}, ref_cnt=0, size=1048, tmp={-8589934593:0}, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4056] RET, EXPR ldv_init_zalloc(1048UL) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_init_zalloc(1048UL)={-8589934593:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4056] tmp = ldv_init_zalloc(1048UL) [L4057] virtio_blk_group0 = (struct virtio_device *)tmp VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, tmp={-8589934593:0}, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}] [L4145] RET ldv_initialize_virtio_driver_1() [L4148] COND FALSE !(ldv_retval_1 != 0) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldvarg0={-4294967297:0}, ldvarg1={4294967303:0}, ldvarg2=46, ldvarg3={4294967302:0}, major=0, ref_cnt=0, tmp={-4294967297:0}, tmp___0=1, tmp___2=1, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}] [L4093] tmp___0 = __VERIFIER_nondet_int() [L4095] case 0: VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldvarg0={-4294967297:0}, ldvarg1={4294967303:0}, ldvarg2=46, ldvarg3={4294967302:0}, major=0, ref_cnt=0, tmp={-4294967297:0}, tmp___0=0, tmp___2=1, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}] [L4096] COND TRUE ldv_state_variable_1 != 0 [L4097] tmp___1 = __VERIFIER_nondet_int() [L4099] case 0: VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldvarg0={-4294967297:0}, ldvarg1={4294967303:0}, ldvarg2=46, ldvarg3={4294967302:0}, major=0, ref_cnt=0, tmp={-4294967297:0}, tmp___0=0, tmp___1=0, tmp___2=1, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}] [L4100] COND TRUE ldv_state_variable_1 == 1 [L4101] CALL virtblk_probe(virtio_blk_group0) [L3828] struct virtio_blk *vblk ; [L3829] struct request_queue *q ; [L3830] int err ; [L3831] u64 cap ; [L3832] u32 v ; [L3833] u32 blk_size ; [L3834] u32 sg_elems ; [L3835] u32 opt_io_size ; [L3836] u16 min_io_size ; [L3837] u8 physical_block_exp ; [L3838] u8 alignment_offset ; [L3839] int tmp ; [L3840] void *tmp___0 ; [L3841] struct lock_class_key __key ; [L3842] long tmp___1 ; [L3843] long tmp___2 ; [L3844] struct request_queue *tmp___3 ; [L3845] unsigned int m1 ; [L3846] unsigned int m2 ; [L3847] unsigned int m3 ; [L3848] bool tmp___4 ; [L3849] bool tmp___5 ; [L3850] bool tmp___6 ; [L3851] unsigned short tmp___9 ; VAL [__key={4294967315:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, alignment_offset={4294967307:0}, blk_size={4294967322:0}, cap={4294967318:0}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, min_io_size={4294967310:0}, opt_io_size={4294967323:0}, physical_block_exp={4294967314:0}, ref_cnt=0, sg_elems={4294967311:0}, v={4294967319:0}, vdev={-8589934593:0}, vdev={-8589934593:0}, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}] [L3853] CALL, EXPR index_to_minor(index) VAL [\old(index___0)=0, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}] [L3823] EXPR index___0 << 4 [L3823] return (index___0 << 4); VAL [\old(index___0)=0, \result=0, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, index___0=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}] [L3853] RET, EXPR index_to_minor(index) VAL [__key={4294967315:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, alignment_offset={4294967307:0}, blk_size={4294967322:0}, cap={4294967318:0}, features={13:0}, id_table={12:0}, index=0, index_to_minor(index)=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, min_io_size={4294967310:0}, opt_io_size={4294967323:0}, physical_block_exp={4294967314:0}, ref_cnt=0, sg_elems={4294967311:0}, v={4294967319:0}, vdev={-8589934593:0}, vdev={-8589934593:0}, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}] [L3853] tmp = index_to_minor(index) [L3854] COND FALSE !(tmp > 1048575) VAL [__key={4294967315:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, alignment_offset={4294967307:0}, blk_size={4294967322:0}, cap={4294967318:0}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, min_io_size={4294967310:0}, opt_io_size={4294967323:0}, physical_block_exp={4294967314:0}, ref_cnt=0, sg_elems={4294967311:0}, tmp=0, v={4294967319:0}, vdev={-8589934593:0}, vdev={-8589934593:0}, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}] [L3858] CALL, EXPR virtio_config_buf(vdev, 2U, 12U, (void *)(& sg_elems), 4U) VAL [\old(fbit)=2, \old(len)=4, \old(offset)=12, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, buf={4294967311:0}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, vdev={-8589934593:0}, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}] [L3452] bool tmp ; [L3453] int tmp___0 ; VAL [\old(fbit)=2, \old(len)=4, \old(offset)=12, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, buf={4294967311:0}, buf={4294967311:0}, fbit=2, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, len=4, major=0, offset=12, ref_cnt=0, vdev={-8589934593:0}, vdev={-8589934593:0}, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}] [L3455] CALL, EXPR virtio_has_feature((struct virtio_device const *)vdev, fbit) VAL [\old(fbit)=2, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, vdev={-8589934593:0}, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}] [L3439] int tmp ; VAL [\old(fbit)=2, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, fbit=2, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, vdev={-8589934593:0}, vdev={-8589934593:0}, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}] [L3441] COND TRUE fbit <= 27U [L3442] FCALL virtio_check_driver_offered_feature(vdev, fbit) [L3445] CALL, EXPR variable_test_bit((int )fbit, (unsigned long const volatile *)(& vdev->features)) [L3093] int oldbit ; [L3097] return (oldbit); VAL [\old(nr)=2, \result=0, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, addr={-8589934593:575}, addr={-8589934593:575}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, nr=2, oldbit=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}] [L3445] RET, EXPR variable_test_bit((int )fbit, (unsigned long const volatile *)(& vdev->features)) [L3445] tmp = variable_test_bit((int )fbit, (unsigned long const volatile *)(& vdev->features)) [L3446] return (tmp != 0); VAL [\old(fbit)=2, \result=0, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, fbit=2, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, tmp=0, vdev={-8589934593:0}, vdev={-8589934593:0}, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}] [L3455] RET, EXPR virtio_has_feature((struct virtio_device const *)vdev, fbit) VAL [\old(fbit)=2, \old(len)=4, \old(offset)=12, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, buf={4294967311:0}, buf={4294967311:0}, fbit=2, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, len=4, major=0, offset=12, ref_cnt=0, vdev={-8589934593:0}, vdev={-8589934593:0}, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}, virtio_has_feature((struct virtio_device const *)vdev, fbit)=0] [L3455] tmp = virtio_has_feature((struct virtio_device const *)vdev, fbit) [L3456] COND FALSE !(\read(tmp)) [L3459] tmp___0 = 1 VAL [\old(fbit)=2, \old(len)=4, \old(offset)=12, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, buf={4294967311:0}, buf={4294967311:0}, fbit=2, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, len=4, major=0, offset=12, ref_cnt=0, tmp=0, tmp___0=1, vdev={-8589934593:0}, vdev={-8589934593:0}, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}] [L3461] COND TRUE \read(tmp___0) [L3462] return (-2); VAL [\old(fbit)=2, \old(len)=4, \old(offset)=12, \result=-2, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, buf={4294967311:0}, buf={4294967311:0}, fbit=2, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, len=4, major=0, offset=12, ref_cnt=0, tmp=0, tmp___0=1, vdev={-8589934593:0}, vdev={-8589934593:0}, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}] [L3858] RET, EXPR virtio_config_buf(vdev, 2U, 12U, (void *)(& sg_elems), 4U) VAL [__key={4294967315:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, alignment_offset={4294967307:0}, blk_size={4294967322:0}, cap={4294967318:0}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, min_io_size={4294967310:0}, opt_io_size={4294967323:0}, physical_block_exp={4294967314:0}, ref_cnt=0, sg_elems={4294967311:0}, tmp=0, v={4294967319:0}, vdev={-8589934593:0}, vdev={-8589934593:0}, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}, virtio_config_buf(vdev, 2U, 12U, (void *)(& sg_elems), 4U)=-2] [L3858] err = virtio_config_buf(vdev, 2U, 12U, (void *)(& sg_elems), 4U) [L3859] err != 0 || sg_elems == 0U VAL [__key={4294967315:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, alignment_offset={4294967307:0}, blk_size={4294967322:0}, cap={4294967318:0}, err=-2, err != 0 || sg_elems == 0U=1, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, min_io_size={4294967310:0}, opt_io_size={4294967323:0}, physical_block_exp={4294967314:0}, ref_cnt=0, sg_elems={4294967311:0}, tmp=0, v={4294967319:0}, vdev={-8589934593:0}, vdev={-8589934593:0}, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}] [L3859] COND TRUE err != 0 || sg_elems == 0U [L3860] sg_elems = 1U VAL [__key={4294967315:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, alignment_offset={4294967307:0}, blk_size={4294967322:0}, cap={4294967318:0}, err=-2, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, min_io_size={4294967310:0}, opt_io_size={4294967323:0}, physical_block_exp={4294967314:0}, ref_cnt=0, sg_elems={4294967311:0}, tmp=0, v={4294967319:0}, vdev={-8589934593:0}, vdev={-8589934593:0}, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}] [L3863] EXPR \read(sg_elems) [L3863] sg_elems = sg_elems + 2U [L3864] EXPR \read(sg_elems) [L3864] CALL, EXPR kmalloc((unsigned long )sg_elems * 40UL + 120UL, 208U) [L3349] void *tmp___1 ; [L3351] CALL, EXPR __kmalloc(size, flags) [L3344] CALL, EXPR ldv_malloc(size) VAL [\old(size)=240, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}] [L3254] void *p ; [L3255] void *tmp ; [L3256] int tmp___0 ; [L3258] tmp___0 = __VERIFIER_nondet_int() [L3259] COND FALSE !(tmp___0 != 0) [L3262] tmp = malloc(size) [L3263] p = tmp VAL [\old(size)=240, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, p={-4294965284:0}, ref_cnt=0, size=240, tmp={-4294965284:0}, tmp___0=0, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}] [L3264] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(cond)=1, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}] [L3249] COND FALSE !(!cond) VAL [\old(cond)=1, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, cond=1, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}] [L3264] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(size)=240, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, p={-4294965284:0}, ref_cnt=0, size=240, tmp={-4294965284:0}, tmp___0=0, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}] [L3265] CALL, EXPR IS_ERR(p) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ptr={-4294965284:0}, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}] [L4216] bool tmp ; VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ptr={-4294965284:0}, ptr={-4294965284:0}, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}] [L4218] CALL, EXPR ldv_is_err(ptr) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ptr={-4294965284:0}, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}] [L4242] return ((unsigned long )ptr > 2012UL); VAL [\result=0, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ptr={-4294965284:0}, ptr={-4294965284:0}, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}] [L4218] RET, EXPR ldv_is_err(ptr) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_is_err(ptr)=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ptr={-4294965284:0}, ptr={-4294965284:0}, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}] [L4218] tmp = ldv_is_err(ptr) [L4219] return ((long )tmp); VAL [\result=0, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ptr={-4294965284:0}, ptr={-4294965284:0}, ref_cnt=0, tmp=0, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}] [L3265] RET, EXPR IS_ERR(p) VAL [\old(size)=240, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, IS_ERR(p)=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, p={-4294965284:0}, ref_cnt=0, size=240, tmp={-4294965284:0}, tmp___0=0, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}] [L3265] CALL assume_abort_if_not(IS_ERR(p) == 0) VAL [\old(cond)=1, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}] [L3249] COND FALSE !(!cond) VAL [\old(cond)=1, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, cond=1, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}] [L3265] RET assume_abort_if_not(IS_ERR(p) == 0) VAL [\old(size)=240, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, IS_ERR(p)=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, p={-4294965284:0}, ref_cnt=0, size=240, tmp={-4294965284:0}, tmp___0=0, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}] [L3266] return (p); VAL [\old(size)=240, \result={-4294965284:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, p={-4294965284:0}, ref_cnt=0, size=240, tmp={-4294965284:0}, tmp___0=0, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}] [L3344] RET, EXPR ldv_malloc(size) VAL [\old(size)=240, \old(t)=208, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_malloc(size)={-4294965284:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, size=240, t=208, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}] [L3344] return ldv_malloc(size); [L3351] RET, EXPR __kmalloc(size, flags) [L3351] tmp___1 = __kmalloc(size, flags) [L3352] return (tmp___1); VAL [\old(flags)=208, \old(size)=240, \result={-4294965284:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, flags=208, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, size=240, tmp___1={-4294965284:0}, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}] [L3864] RET, EXPR kmalloc((unsigned long )sg_elems * 40UL + 120UL, 208U) [L3864] tmp___0 = kmalloc((unsigned long )sg_elems * 40UL + 120UL, 208U) [L3865] vblk = (struct virtio_blk *)tmp___0 [L3866] vdev->priv = (void *)vblk VAL [__key={4294967315:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, alignment_offset={4294967307:0}, blk_size={4294967322:0}, cap={4294967318:0}, err=-2, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, min_io_size={4294967310:0}, opt_io_size={4294967323:0}, physical_block_exp={4294967314:0}, ref_cnt=0, sg_elems={4294967311:0}, tmp=0, tmp___0={-4294965284:0}, v={4294967319:0}, vblk={-4294965284:0}, vdev={-8589934593:0}, vdev={-8589934593:0}, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}] [L3867] COND FALSE !((unsigned long )vblk == (unsigned long )((struct virtio_blk *)0)) [L3872] CALL INIT_LIST_HEAD(& vblk->reqs) [L3110] list->next = list [L3111] list->prev = list VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, list={-4294965284:48}, list={-4294965284:48}, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}] [L3872] RET INIT_LIST_HEAD(& vblk->reqs) [L3873] CALL spinlock_check(& vblk->lock) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, lock={-4294965284:0}, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}] [L3136] return (& lock->__annonCompField19.rlock); VAL [\result={-4294965284:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, lock={-4294965284:0}, lock={-4294965284:0}, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}] [L3873] RET spinlock_check(& vblk->lock) VAL [__key={4294967315:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, alignment_offset={4294967307:0}, blk_size={4294967322:0}, cap={4294967318:0}, err=-2, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, min_io_size={4294967310:0}, opt_io_size={4294967323:0}, physical_block_exp={4294967314:0}, ref_cnt=0, sg_elems={4294967311:0}, spinlock_check(& vblk->lock)={-4294965284:0}, tmp=0, tmp___0={-4294965284:0}, v={4294967319:0}, vblk={-4294965284:0}, vdev={-8589934593:0}, vdev={-8589934593:0}, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}] [L3874-L3875] FCALL __raw_spin_lock_init(& vblk->lock.__annonCompField19.rlock, "&(&vblk->lock)->rlock", & __key) [L3876] vblk->vdev = vdev [L3877] EXPR \read(sg_elems) [L3877] vblk->sg_elems = sg_elems [L3878] EXPR vblk->sg_elems [L3878] FCALL sg_init_table((struct scatterlist *)(& vblk->sg), vblk->sg_elems) [L3879] CALL virtio_find_single_vq(vdev, & blk_done, "requests") [L3472] vq_callback_t *callbacks[1U] ; [L3473] char const *names[1U] ; [L3474] struct virtqueue *vq ; [L3475] int err ; [L3476] int tmp ; [L3477] void *tmp___0 ; [L3479] callbacks[0] = c [L3480] names[0] = n [L3481] EXPR vdev->config [L3481] EXPR (vdev->config)->find_vqs [L3481-L3482] EXPR, FCALL (*((vdev->config)->find_vqs))(vdev, 1U, & vq, (vq_callback_t **)(& callbacks), (char const **)(& names)) [L3481-L3482] tmp = (*((vdev->config)->find_vqs))(vdev, 1U, & vq, (vq_callback_t **)(& callbacks), (char const **)(& names)) [L3483] err = tmp VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, c={-1:4}, c={-1:4}, callbacks={4294967327:0}, err=-2147481636, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, n={4:0}, n={4:0}, names={4294967299:0}, ref_cnt=0, tmp=-2147481636, vdev={-8589934593:0}, vdev={-8589934593:0}, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}, vq={4294967326:0}] [L3484] COND TRUE err < 0 [L3485] CALL ERR_PTR((long )err) [L4200] void *tmp ; [L4202] CALL ldv_err_ptr(error) [L4248] 2012L - error VAL [\old(error)=-2147481636, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967337:4294967340}, error=-2147481636, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={4294967297:0}, virtio_blk={14:0}, virtio_blk_group0={-8589934593:0}] - UnprovableResult [Line: 3677]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3677]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3823]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3823]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4248]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3909]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3909]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3912]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3912]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3912]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3912]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3912]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3912]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3914]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3914]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3914]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3914]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3914]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3914]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3914]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3914]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3915]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3915]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3915]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3915]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3924]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3924]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4114]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4114]: 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 27 procedures, 527 locations, 32 error locations. Started 1 CEGAR loops. OverallTime: 66.6s, OverallIterations: 15, TraceHistogramMax: 12, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 34.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10214 SdHoareTripleChecker+Valid, 24.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9690 mSDsluCounter, 43722 SdHoareTripleChecker+Invalid, 21.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 34461 mSDsCounter, 5428 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18053 IncrementalHoareTripleChecker+Invalid, 23481 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5428 mSolverCounterUnsat, 9261 mSDtfsCounter, 18053 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1681 GetRequests, 1472 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1053 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2873occurred in iteration=14, InterpolantAutomatonStates: 145, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.8s AutomataMinimizationTime, 14 MinimizatonAttempts, 11826 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 14.5s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 2452 NumberOfCodeBlocks, 2452 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2742 ConstructedInterpolants, 0 QuantifiedInterpolants, 4479 SizeOfPredicates, 17 NumberOfNonLiveVariables, 6011 ConjunctsInSsa, 100 ConjunctsInUnsatCore, 21 InterpolantComputations, 11 PerfectInterpolantSequences, 1337/1525 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 could not prove your program: unable to determine feasibility of some traces [2022-10-16 14:09:55,661 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...