/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.6/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 21:33:39,459 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 21:33:39,464 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 21:33:39,528 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 21:33:39,528 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 21:33:39,532 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 21:33:39,538 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 21:33:39,558 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 21:33:39,563 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 21:33:39,569 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 21:33:39,571 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 21:33:39,574 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 21:33:39,575 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 21:33:39,578 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 21:33:39,580 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 21:33:39,586 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 21:33:39,587 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 21:33:39,589 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 21:33:39,593 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 21:33:39,600 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 21:33:39,602 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 21:33:39,604 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 21:33:39,605 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 21:33:39,608 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 21:33:39,618 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 21:33:39,618 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 21:33:39,619 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 21:33:39,621 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 21:33:39,622 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 21:33:39,623 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 21:33:39,624 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 21:33:39,625 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 21:33:39,626 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 21:33:39,627 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 21:33:39,629 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 21:33:39,629 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 21:33:39,630 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 21:33:39,630 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 21:33:39,630 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 21:33:39,631 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 21:33:39,632 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 21:33:39,633 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-15 21:33:39,684 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 21:33:39,684 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 21:33:39,685 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 21:33:39,685 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 21:33:39,687 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 21:33:39,687 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 21:33:39,689 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 21:33:39,690 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 21:33:39,690 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 21:33:39,690 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 21:33:39,691 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 21:33:39,691 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 21:33:39,692 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 21:33:39,692 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 21:33:39,692 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 21:33:39,692 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-15 21:33:39,692 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 21:33:39,693 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-15 21:33:39,693 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-15 21:33:39,693 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 21:33:39,693 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-15 21:33:39,693 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 21:33:39,694 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-15 21:33:39,694 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 21:33:39,694 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 21:33:39,694 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 21:33:39,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 21:33:39,695 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 21:33:39,695 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 21:33:39,695 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-15 21:33:39,695 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 21:33:39,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 21:33:39,696 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-15 21:33:39,696 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-15 21:33:40,148 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 21:33:40,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 21:33:40,185 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 21:33:40,187 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 21:33:40,187 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 21:33:40,189 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point.cil.out.i [2022-10-15 21:33:40,280 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0915a00cf/85ae496ce2ae4cc6a297b28588254885/FLAGc4470b46a [2022-10-15 21:33:41,176 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 21:33:41,177 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point.cil.out.i [2022-10-15 21:33:41,220 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0915a00cf/85ae496ce2ae4cc6a297b28588254885/FLAGc4470b46a [2022-10-15 21:33:41,258 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0915a00cf/85ae496ce2ae4cc6a297b28588254885 [2022-10-15 21:33:41,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 21:33:41,269 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 21:33:41,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 21:33:41,274 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 21:33:41,279 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 21:33:41,280 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:33:41" (1/1) ... [2022-10-15 21:33:41,282 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@173bb6b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:33:41, skipping insertion in model container [2022-10-15 21:33:41,282 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:33:41" (1/1) ... [2022-10-15 21:33:41,291 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 21:33:41,395 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 21:33:42,438 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.6/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point.cil.out.i[100586,100599] [2022-10-15 21:33:42,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 21:33:42,759 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 21:33:42,949 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.6/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point.cil.out.i[100586,100599] [2022-10-15 21:33:43,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 21:33:43,179 INFO L208 MainTranslator]: Completed translation [2022-10-15 21:33:43,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:33:43 WrapperNode [2022-10-15 21:33:43,180 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 21:33:43,181 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 21:33:43,181 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 21:33:43,182 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 21:33:43,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:33:43" (1/1) ... [2022-10-15 21:33:43,281 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:33:43" (1/1) ... [2022-10-15 21:33:43,467 INFO L138 Inliner]: procedures = 155, calls = 536, calls flagged for inlining = 94, calls inlined = 94, statements flattened = 1933 [2022-10-15 21:33:43,467 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 21:33:43,468 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 21:33:43,468 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 21:33:43,469 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 21:33:43,483 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:33:43" (1/1) ... [2022-10-15 21:33:43,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:33:43" (1/1) ... [2022-10-15 21:33:43,519 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:33:43" (1/1) ... [2022-10-15 21:33:43,520 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:33:43" (1/1) ... [2022-10-15 21:33:43,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:33:43" (1/1) ... [2022-10-15 21:33:43,688 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:33:43" (1/1) ... [2022-10-15 21:33:43,715 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:33:43" (1/1) ... [2022-10-15 21:33:43,737 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:33:43" (1/1) ... [2022-10-15 21:33:43,768 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 21:33:43,771 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 21:33:43,771 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 21:33:43,772 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 21:33:43,773 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:33:43" (1/1) ... [2022-10-15 21:33:43,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 21:33:43,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:33:43,821 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-15 21:33:43,831 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-15 21:33:43,891 INFO L130 BoogieDeclarations]: Found specification of procedure blk_queue_max_segment_size [2022-10-15 21:33:43,891 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_queue_max_segment_size [2022-10-15 21:33:43,891 INFO L130 BoogieDeclarations]: Found specification of procedure virtio_config_buf [2022-10-15 21:33:43,892 INFO L138 BoogieDeclarations]: Found implementation of procedure virtio_config_buf [2022-10-15 21:33:43,892 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-10-15 21:33:43,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-10-15 21:33:43,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 21:33:43,893 INFO L130 BoogieDeclarations]: Found specification of procedure req_get_ioprio [2022-10-15 21:33:43,893 INFO L138 BoogieDeclarations]: Found implementation of procedure req_get_ioprio [2022-10-15 21:33:43,894 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~TO~VOID [2022-10-15 21:33:43,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~TO~VOID [2022-10-15 21:33:43,894 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-10-15 21:33:43,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-10-15 21:33:43,894 INFO L130 BoogieDeclarations]: Found specification of procedure mempool_free [2022-10-15 21:33:43,895 INFO L138 BoogieDeclarations]: Found implementation of procedure mempool_free [2022-10-15 21:33:43,895 INFO L130 BoogieDeclarations]: Found specification of procedure sg_set_buf [2022-10-15 21:33:43,895 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_set_buf [2022-10-15 21:33:43,895 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-10-15 21:33:43,895 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-10-15 21:33:43,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 21:33:43,896 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-10-15 21:33:43,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-10-15 21:33:43,896 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-10-15 21:33:43,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-10-15 21:33:43,896 INFO L130 BoogieDeclarations]: Found specification of procedure index_to_minor [2022-10-15 21:33:43,896 INFO L138 BoogieDeclarations]: Found implementation of procedure index_to_minor [2022-10-15 21:33:43,897 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-10-15 21:33:43,897 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-10-15 21:33:43,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-15 21:33:43,897 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2022-10-15 21:33:43,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2022-10-15 21:33:43,897 INFO L130 BoogieDeclarations]: Found specification of procedure kmem_cache_alloc_notrace [2022-10-15 21:33:43,897 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-10-15 21:33:43,898 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-10-15 21:33:43,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 21:33:43,898 INFO L130 BoogieDeclarations]: Found specification of procedure virtio_has_feature [2022-10-15 21:33:43,898 INFO L138 BoogieDeclarations]: Found implementation of procedure virtio_has_feature [2022-10-15 21:33:43,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 21:33:43,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-15 21:33:43,899 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-10-15 21:33:43,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-10-15 21:33:43,899 INFO L130 BoogieDeclarations]: Found specification of procedure virtblk_remove [2022-10-15 21:33:43,900 INFO L138 BoogieDeclarations]: Found implementation of procedure virtblk_remove [2022-10-15 21:33:43,900 INFO L130 BoogieDeclarations]: Found specification of procedure mempool_destroy [2022-10-15 21:33:43,900 INFO L138 BoogieDeclarations]: Found implementation of procedure mempool_destroy [2022-10-15 21:33:43,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-15 21:33:43,900 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock_sched_notrace [2022-10-15 21:33:43,900 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock_sched_notrace [2022-10-15 21:33:43,901 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2022-10-15 21:33:43,901 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2022-10-15 21:33:43,902 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-10-15 21:33:43,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-10-15 21:33:43,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 21:33:43,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-10-15 21:33:43,903 INFO L130 BoogieDeclarations]: Found specification of procedure trace_kmalloc [2022-10-15 21:33:43,903 INFO L138 BoogieDeclarations]: Found implementation of procedure trace_kmalloc [2022-10-15 21:33:43,904 INFO L130 BoogieDeclarations]: Found specification of procedure put_disk [2022-10-15 21:33:43,904 INFO L138 BoogieDeclarations]: Found implementation of procedure put_disk [2022-10-15 21:33:43,904 INFO L130 BoogieDeclarations]: Found specification of procedure blk_queue_ordered [2022-10-15 21:33:43,904 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_queue_ordered [2022-10-15 21:33:43,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 21:33:43,904 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-10-15 21:33:43,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-10-15 21:33:43,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 21:33:43,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 21:33:43,906 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-10-15 21:33:43,906 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-10-15 21:33:44,477 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 21:33:44,480 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 21:33:45,371 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-10-15 21:33:45,471 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2022-10-15 21:33:46,308 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 21:33:46,324 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 21:33:46,324 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-15 21:33:46,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:33:46 BoogieIcfgContainer [2022-10-15 21:33:46,328 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 21:33:46,332 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 21:33:46,332 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 21:33:46,336 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 21:33:46,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 09:33:41" (1/3) ... [2022-10-15 21:33:46,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fe861b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:33:46, skipping insertion in model container [2022-10-15 21:33:46,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:33:43" (2/3) ... [2022-10-15 21:33:46,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fe861b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:33:46, skipping insertion in model container [2022-10-15 21:33:46,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:33:46" (3/3) ... [2022-10-15 21:33:46,340 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point.cil.out.i [2022-10-15 21:33:46,364 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 21:33:46,365 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2022-10-15 21:33:46,451 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 21:33:46,461 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;@2c944a85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 21:33:46,461 INFO L358 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2022-10-15 21:33:46,469 INFO L276 IsEmpty]: Start isEmpty. Operand has 586 states, 438 states have (on average 1.3949771689497716) internal successors, (611), 484 states have internal predecessors, (611), 88 states have call successors, (88), 27 states have call predecessors, (88), 25 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) [2022-10-15 21:33:46,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-15 21:33:46,502 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:33:46,503 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:33:46,504 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting index_to_minorErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-10-15 21:33:46,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:33:46,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1355650994, now seen corresponding path program 1 times [2022-10-15 21:33:46,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:33:46,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770862729] [2022-10-15 21:33:46,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:33:46,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:33:46,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:33:47,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:33:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:33:47,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:33:47,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:33:47,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770862729] [2022-10-15 21:33:47,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770862729] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:33:47,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:33:47,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:33:47,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11058821] [2022-10-15 21:33:47,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:33:47,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:33:47,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:33:47,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:33:47,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:33:47,222 INFO L87 Difference]: Start difference. First operand has 586 states, 438 states have (on average 1.3949771689497716) internal successors, (611), 484 states have internal predecessors, (611), 88 states have call successors, (88), 27 states have call predecessors, (88), 25 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 21:33:48,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:33:48,431 INFO L93 Difference]: Finished difference Result 1293 states and 1770 transitions. [2022-10-15 21:33:48,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:33:48,434 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-10-15 21:33:48,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:33:48,461 INFO L225 Difference]: With dead ends: 1293 [2022-10-15 21:33:48,461 INFO L226 Difference]: Without dead ends: 666 [2022-10-15 21:33:48,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:33:48,481 INFO L413 NwaCegarLoop]: 671 mSDtfsCounter, 337 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 1520 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-10-15 21:33:48,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 1520 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-10-15 21:33:48,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2022-10-15 21:33:48,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 621. [2022-10-15 21:33:48,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 468 states have (on average 1.3012820512820513) internal successors, (609), 498 states have internal predecessors, (609), 95 states have call successors, (95), 32 states have call predecessors, (95), 32 states have return successors, (95), 94 states have call predecessors, (95), 95 states have call successors, (95) [2022-10-15 21:33:48,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 799 transitions. [2022-10-15 21:33:48,628 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 799 transitions. Word has length 19 [2022-10-15 21:33:48,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:33:48,629 INFO L495 AbstractCegarLoop]: Abstraction has 621 states and 799 transitions. [2022-10-15 21:33:48,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 21:33:48,630 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 799 transitions. [2022-10-15 21:33:48,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-10-15 21:33:48,635 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:33:48,635 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:33:48,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 21:33:48,636 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting index_to_minorErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-10-15 21:33:48,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:33:48,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1956320374, now seen corresponding path program 1 times [2022-10-15 21:33:48,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:33:48,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703412209] [2022-10-15 21:33:48,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:33:48,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:33:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:33:49,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:33:49,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:33:49,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-10-15 21:33:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:33:49,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-15 21:33:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:33:49,089 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-10-15 21:33:49,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:33:49,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703412209] [2022-10-15 21:33:49,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703412209] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:33:49,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:33:49,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 21:33:49,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066298883] [2022-10-15 21:33:49,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:33:49,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:33:49,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:33:49,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:33:49,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:33:49,094 INFO L87 Difference]: Start difference. First operand 621 states and 799 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 21:33:50,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:33:50,543 INFO L93 Difference]: Finished difference Result 1833 states and 2394 transitions. [2022-10-15 21:33:50,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 21:33:50,544 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2022-10-15 21:33:50,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:33:50,558 INFO L225 Difference]: With dead ends: 1833 [2022-10-15 21:33:50,559 INFO L226 Difference]: Without dead ends: 1219 [2022-10-15 21:33:50,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:33:50,564 INFO L413 NwaCegarLoop]: 660 mSDtfsCounter, 672 mSDsluCounter, 1772 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 2432 SdHoareTripleChecker+Invalid, 1080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-10-15 21:33:50,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 2432 Invalid, 1080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-10-15 21:33:50,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2022-10-15 21:33:50,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1127. [2022-10-15 21:33:50,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1127 states, 864 states have (on average 1.2824074074074074) internal successors, (1108), 898 states have internal predecessors, (1108), 175 states have call successors, (175), 62 states have call predecessors, (175), 62 states have return successors, (175), 173 states have call predecessors, (175), 175 states have call successors, (175) [2022-10-15 21:33:50,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1458 transitions. [2022-10-15 21:33:50,689 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1458 transitions. Word has length 45 [2022-10-15 21:33:50,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:33:50,690 INFO L495 AbstractCegarLoop]: Abstraction has 1127 states and 1458 transitions. [2022-10-15 21:33:50,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 21:33:50,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1458 transitions. [2022-10-15 21:33:50,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-10-15 21:33:50,694 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:33:50,695 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:33:50,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 21:33:50,695 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-10-15 21:33:50,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:33:50,696 INFO L85 PathProgramCache]: Analyzing trace with hash -711481722, now seen corresponding path program 1 times [2022-10-15 21:33:50,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:33:50,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392884234] [2022-10-15 21:33:50,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:33:50,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:33:50,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:33:50,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:33:50,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:33:50,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-10-15 21:33:50,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:33:50,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-15 21:33:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:33:50,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-15 21:33:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:33:50,950 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-10-15 21:33:50,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:33:50,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392884234] [2022-10-15 21:33:50,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392884234] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:33:50,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:33:50,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:33:50,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67963861] [2022-10-15 21:33:50,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:33:50,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:33:50,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:33:50,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:33:50,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:33:50,955 INFO L87 Difference]: Start difference. First operand 1127 states and 1458 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 21:33:52,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:33:52,176 INFO L93 Difference]: Finished difference Result 2419 states and 3188 transitions. [2022-10-15 21:33:52,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:33:52,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 53 [2022-10-15 21:33:52,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:33:52,208 INFO L225 Difference]: With dead ends: 2419 [2022-10-15 21:33:52,208 INFO L226 Difference]: Without dead ends: 2415 [2022-10-15 21:33:52,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:33:52,226 INFO L413 NwaCegarLoop]: 689 mSDtfsCounter, 784 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 1510 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:33:52,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 1510 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-10-15 21:33:52,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2415 states. [2022-10-15 21:33:52,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2415 to 2221. [2022-10-15 21:33:52,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2221 states, 1722 states have (on average 1.278164924506388) internal successors, (2201), 1765 states have internal predecessors, (2201), 349 states have call successors, (349), 124 states have call predecessors, (349), 124 states have return successors, (349), 345 states have call predecessors, (349), 349 states have call successors, (349) [2022-10-15 21:33:52,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2221 states to 2221 states and 2899 transitions. [2022-10-15 21:33:52,448 INFO L78 Accepts]: Start accepts. Automaton has 2221 states and 2899 transitions. Word has length 53 [2022-10-15 21:33:52,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:33:52,453 INFO L495 AbstractCegarLoop]: Abstraction has 2221 states and 2899 transitions. [2022-10-15 21:33:52,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 21:33:52,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2221 states and 2899 transitions. [2022-10-15 21:33:52,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-10-15 21:33:52,462 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:33:52,462 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2022-10-15 21:33:52,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 21:33:52,463 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-10-15 21:33:52,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:33:52,464 INFO L85 PathProgramCache]: Analyzing trace with hash 692796134, now seen corresponding path program 1 times [2022-10-15 21:33:52,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:33:52,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883506681] [2022-10-15 21:33:52,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:33:52,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:33:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:33:52,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:33:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:33:52,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-10-15 21:33:52,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:33:52,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-15 21:33:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:33:52,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-15 21:33:52,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:33:52,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-10-15 21:33:52,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:33:52,851 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-10-15 21:33:52,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:33:52,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883506681] [2022-10-15 21:33:52,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883506681] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:33:52,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:33:52,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 21:33:52,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417501871] [2022-10-15 21:33:52,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:33:52,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:33:52,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:33:52,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:33:52,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:33:52,854 INFO L87 Difference]: Start difference. First operand 2221 states and 2899 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 21:33:54,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:33:54,706 INFO L93 Difference]: Finished difference Result 5901 states and 7799 transitions. [2022-10-15 21:33:54,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 21:33:54,710 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 70 [2022-10-15 21:33:54,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:33:54,759 INFO L225 Difference]: With dead ends: 5901 [2022-10-15 21:33:54,759 INFO L226 Difference]: Without dead ends: 4777 [2022-10-15 21:33:54,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-10-15 21:33:54,771 INFO L413 NwaCegarLoop]: 1189 mSDtfsCounter, 791 mSDsluCounter, 1950 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 3139 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-10-15 21:33:54,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [846 Valid, 3139 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-10-15 21:33:54,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4777 states. [2022-10-15 21:33:55,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4777 to 2724. [2022-10-15 21:33:55,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2724 states, 2115 states have (on average 1.2728132387706856) internal successors, (2692), 2164 states have internal predecessors, (2692), 429 states have call successors, (429), 154 states have call predecessors, (429), 154 states have return successors, (429), 421 states have call predecessors, (429), 429 states have call successors, (429) [2022-10-15 21:33:55,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2724 states to 2724 states and 3550 transitions. [2022-10-15 21:33:55,059 INFO L78 Accepts]: Start accepts. Automaton has 2724 states and 3550 transitions. Word has length 70 [2022-10-15 21:33:55,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:33:55,060 INFO L495 AbstractCegarLoop]: Abstraction has 2724 states and 3550 transitions. [2022-10-15 21:33:55,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 21:33:55,060 INFO L276 IsEmpty]: Start isEmpty. Operand 2724 states and 3550 transitions. [2022-10-15 21:33:55,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-10-15 21:33:55,064 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:33:55,065 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:33:55,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 21:33:55,065 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-10-15 21:33:55,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:33:55,066 INFO L85 PathProgramCache]: Analyzing trace with hash -901775306, now seen corresponding path program 1 times [2022-10-15 21:33:55,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:33:55,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763565427] [2022-10-15 21:33:55,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:33:55,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:33:55,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:33:55,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:33:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:33:55,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-10-15 21:33:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:33:55,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-15 21:33:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:33:55,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-15 21:33:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:33:55,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-15 21:33:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:33:55,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:33:55,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:33:55,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-10-15 21:33:55,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:33:55,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-10-15 21:33:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:33:55,382 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-10-15 21:33:55,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:33:55,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763565427] [2022-10-15 21:33:55,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763565427] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:33:55,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:33:55,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 21:33:55,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122565799] [2022-10-15 21:33:55,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:33:55,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:33:55,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:33:55,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:33:55,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:33:55,388 INFO L87 Difference]: Start difference. First operand 2724 states and 3550 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-15 21:33:56,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:33:56,362 INFO L93 Difference]: Finished difference Result 6076 states and 8116 transitions. [2022-10-15 21:33:56,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:33:56,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 90 [2022-10-15 21:33:56,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:33:56,401 INFO L225 Difference]: With dead ends: 6076 [2022-10-15 21:33:56,401 INFO L226 Difference]: Without dead ends: 3359 [2022-10-15 21:33:56,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:33:56,419 INFO L413 NwaCegarLoop]: 626 mSDtfsCounter, 302 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-15 21:33:56,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 1550 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-15 21:33:56,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3359 states. [2022-10-15 21:33:56,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3359 to 2734. [2022-10-15 21:33:56,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2734 states, 2125 states have (on average 1.2715294117647058) internal successors, (2702), 2174 states have internal predecessors, (2702), 429 states have call successors, (429), 154 states have call predecessors, (429), 154 states have return successors, (429), 421 states have call predecessors, (429), 429 states have call successors, (429) [2022-10-15 21:33:56,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2734 states to 2734 states and 3560 transitions. [2022-10-15 21:33:56,669 INFO L78 Accepts]: Start accepts. Automaton has 2734 states and 3560 transitions. Word has length 90 [2022-10-15 21:33:56,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:33:56,670 INFO L495 AbstractCegarLoop]: Abstraction has 2734 states and 3560 transitions. [2022-10-15 21:33:56,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-15 21:33:56,670 INFO L276 IsEmpty]: Start isEmpty. Operand 2734 states and 3560 transitions. [2022-10-15 21:33:56,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-10-15 21:33:56,674 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:33:56,675 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:33:56,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 21:33:56,675 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-10-15 21:33:56,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:33:56,676 INFO L85 PathProgramCache]: Analyzing trace with hash -879143052, now seen corresponding path program 1 times [2022-10-15 21:33:56,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:33:56,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863933700] [2022-10-15 21:33:56,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:33:56,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:33:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:33:56,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:33:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:33:56,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-10-15 21:33:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:33:56,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-15 21:33:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:33:57,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-15 21:33:57,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:33:57,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-15 21:33:57,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:33:57,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:33:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:33:57,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-10-15 21:33:57,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:33:57,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-10-15 21:33:57,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:33:57,051 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 21:33:57,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:33:57,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863933700] [2022-10-15 21:33:57,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863933700] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:33:57,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:33:57,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 21:33:57,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423510318] [2022-10-15 21:33:57,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:33:57,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:33:57,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:33:57,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:33:57,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:33:57,055 INFO L87 Difference]: Start difference. First operand 2734 states and 3560 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (8), 3 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-15 21:33:58,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:33:58,261 INFO L93 Difference]: Finished difference Result 6096 states and 8092 transitions. [2022-10-15 21:33:58,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 21:33:58,262 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (8), 3 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 90 [2022-10-15 21:33:58,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:33:58,296 INFO L225 Difference]: With dead ends: 6096 [2022-10-15 21:33:58,296 INFO L226 Difference]: Without dead ends: 3339 [2022-10-15 21:33:58,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-10-15 21:33:58,312 INFO L413 NwaCegarLoop]: 616 mSDtfsCounter, 191 mSDsluCounter, 1692 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 2308 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-10-15 21:33:58,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 2308 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-10-15 21:33:58,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2022-10-15 21:33:58,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 2734. [2022-10-15 21:33:58,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2734 states, 2125 states have (on average 1.2668235294117647) internal successors, (2692), 2174 states have internal predecessors, (2692), 429 states have call successors, (429), 154 states have call predecessors, (429), 154 states have return successors, (429), 421 states have call predecessors, (429), 429 states have call successors, (429) [2022-10-15 21:33:58,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2734 states to 2734 states and 3550 transitions. [2022-10-15 21:33:58,589 INFO L78 Accepts]: Start accepts. Automaton has 2734 states and 3550 transitions. Word has length 90 [2022-10-15 21:33:58,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:33:58,590 INFO L495 AbstractCegarLoop]: Abstraction has 2734 states and 3550 transitions. [2022-10-15 21:33:58,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (8), 3 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-15 21:33:58,591 INFO L276 IsEmpty]: Start isEmpty. Operand 2734 states and 3550 transitions. [2022-10-15 21:33:58,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-10-15 21:33:58,595 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:33:58,595 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:33:58,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 21:33:58,595 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-10-15 21:33:58,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:33:58,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1034540927, now seen corresponding path program 1 times [2022-10-15 21:33:58,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:33:58,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451050715] [2022-10-15 21:33:58,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:33:58,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:33:58,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:33:58,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:33:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:33:58,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 21:33:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:33:58,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-10-15 21:33:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:33:58,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-15 21:33:58,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:33:58,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 21:33:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:33:59,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:33:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:33:59,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-10-15 21:33:59,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:33:59,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-10-15 21:33:59,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:33:59,150 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-10-15 21:33:59,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:33:59,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451050715] [2022-10-15 21:33:59,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451050715] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:33:59,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:33:59,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-10-15 21:33:59,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398391344] [2022-10-15 21:33:59,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:33:59,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-15 21:33:59,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:33:59,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-15 21:33:59,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:33:59,153 INFO L87 Difference]: Start difference. First operand 2734 states and 3550 transitions. Second operand has 9 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-10-15 21:34:00,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:34:00,788 INFO L93 Difference]: Finished difference Result 6156 states and 8163 transitions. [2022-10-15 21:34:00,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 21:34:00,789 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 91 [2022-10-15 21:34:00,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:34:00,822 INFO L225 Difference]: With dead ends: 6156 [2022-10-15 21:34:00,822 INFO L226 Difference]: Without dead ends: 3429 [2022-10-15 21:34:00,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-10-15 21:34:00,839 INFO L413 NwaCegarLoop]: 601 mSDtfsCounter, 346 mSDsluCounter, 2838 mSDsCounter, 0 mSdLazyCounter, 1071 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 3439 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 1071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:34:00,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 3439 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 1071 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-10-15 21:34:00,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3429 states. [2022-10-15 21:34:01,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3429 to 2824. [2022-10-15 21:34:01,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2824 states, 2190 states have (on average 1.2634703196347032) internal successors, (2767), 2249 states have internal predecessors, (2767), 439 states have call successors, (439), 159 states have call predecessors, (439), 169 states have return successors, (449), 431 states have call predecessors, (449), 439 states have call successors, (449) [2022-10-15 21:34:01,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2824 states and 3655 transitions. [2022-10-15 21:34:01,105 INFO L78 Accepts]: Start accepts. Automaton has 2824 states and 3655 transitions. Word has length 91 [2022-10-15 21:34:01,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:34:01,106 INFO L495 AbstractCegarLoop]: Abstraction has 2824 states and 3655 transitions. [2022-10-15 21:34:01,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-10-15 21:34:01,106 INFO L276 IsEmpty]: Start isEmpty. Operand 2824 states and 3655 transitions. [2022-10-15 21:34:01,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-10-15 21:34:01,111 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:34:01,111 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:34:01,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 21:34:01,112 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-10-15 21:34:01,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:34:01,133 INFO L85 PathProgramCache]: Analyzing trace with hash -138279668, now seen corresponding path program 1 times [2022-10-15 21:34:01,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:34:01,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533506793] [2022-10-15 21:34:01,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:34:01,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:34:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:01,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:34:01,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:01,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 21:34:01,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:01,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-10-15 21:34:01,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:01,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-15 21:34:01,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:01,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 21:34:01,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:01,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:01,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:01,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-10-15 21:34:01,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:01,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-10-15 21:34:01,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:01,962 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-10-15 21:34:01,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:34:01,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533506793] [2022-10-15 21:34:01,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533506793] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:34:01,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:34:01,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-10-15 21:34:01,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407526786] [2022-10-15 21:34:01,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:34:01,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-15 21:34:01,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:34:01,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-15 21:34:01,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:34:01,965 INFO L87 Difference]: Start difference. First operand 2824 states and 3655 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-15 21:34:04,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:34:04,071 INFO L93 Difference]: Finished difference Result 7670 states and 10330 transitions. [2022-10-15 21:34:04,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 21:34:04,072 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 92 [2022-10-15 21:34:04,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:34:04,133 INFO L225 Difference]: With dead ends: 7670 [2022-10-15 21:34:04,133 INFO L226 Difference]: Without dead ends: 4853 [2022-10-15 21:34:04,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-10-15 21:34:04,153 INFO L413 NwaCegarLoop]: 771 mSDtfsCounter, 774 mSDsluCounter, 3766 mSDsCounter, 0 mSdLazyCounter, 1359 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 4537 SdHoareTripleChecker+Invalid, 1547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 1359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-10-15 21:34:04,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 4537 Invalid, 1547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 1359 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-10-15 21:34:04,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4853 states. [2022-10-15 21:34:04,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4853 to 2850. [2022-10-15 21:34:04,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2850 states, 2211 states have (on average 1.2609678878335595) internal successors, (2788), 2271 states have internal predecessors, (2788), 439 states have call successors, (439), 159 states have call predecessors, (439), 174 states have return successors, (494), 435 states have call predecessors, (494), 439 states have call successors, (494) [2022-10-15 21:34:04,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2850 states to 2850 states and 3721 transitions. [2022-10-15 21:34:04,520 INFO L78 Accepts]: Start accepts. Automaton has 2850 states and 3721 transitions. Word has length 92 [2022-10-15 21:34:04,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:34:04,521 INFO L495 AbstractCegarLoop]: Abstraction has 2850 states and 3721 transitions. [2022-10-15 21:34:04,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-15 21:34:04,521 INFO L276 IsEmpty]: Start isEmpty. Operand 2850 states and 3721 transitions. [2022-10-15 21:34:04,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-10-15 21:34:04,526 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:34:04,526 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:34:04,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 21:34:04,527 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-10-15 21:34:04,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:34:04,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1035443231, now seen corresponding path program 1 times [2022-10-15 21:34:04,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:34:04,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319536267] [2022-10-15 21:34:04,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:34:04,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:34:04,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:05,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:34:05,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:05,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 21:34:05,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:05,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-10-15 21:34:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:05,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-15 21:34:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:05,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 21:34:05,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:05,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:05,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:05,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-10-15 21:34:05,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:05,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:34:05,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:05,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-10-15 21:34:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:05,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-15 21:34:05,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:05,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-15 21:34:05,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:05,142 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-15 21:34:05,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:34:05,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319536267] [2022-10-15 21:34:05,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319536267] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:34:05,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:34:05,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 21:34:05,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262129548] [2022-10-15 21:34:05,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:34:05,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:34:05,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:34:05,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:34:05,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:34:05,146 INFO L87 Difference]: Start difference. First operand 2850 states and 3721 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 21:34:06,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:34:06,219 INFO L93 Difference]: Finished difference Result 6290 states and 8327 transitions. [2022-10-15 21:34:06,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:34:06,220 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2022-10-15 21:34:06,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:34:06,260 INFO L225 Difference]: With dead ends: 6290 [2022-10-15 21:34:06,261 INFO L226 Difference]: Without dead ends: 3446 [2022-10-15 21:34:06,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:34:06,279 INFO L413 NwaCegarLoop]: 616 mSDtfsCounter, 297 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 1534 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-15 21:34:06,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 1534 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-10-15 21:34:06,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3446 states. [2022-10-15 21:34:06,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3446 to 2851. [2022-10-15 21:34:06,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2851 states, 2212 states have (on average 1.2608499095840868) internal successors, (2789), 2272 states have internal predecessors, (2789), 439 states have call successors, (439), 159 states have call predecessors, (439), 174 states have return successors, (494), 435 states have call predecessors, (494), 439 states have call successors, (494) [2022-10-15 21:34:06,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2851 states and 3722 transitions. [2022-10-15 21:34:06,586 INFO L78 Accepts]: Start accepts. Automaton has 2851 states and 3722 transitions. Word has length 108 [2022-10-15 21:34:06,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:34:06,586 INFO L495 AbstractCegarLoop]: Abstraction has 2851 states and 3722 transitions. [2022-10-15 21:34:06,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 21:34:06,588 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 3722 transitions. [2022-10-15 21:34:06,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-10-15 21:34:06,594 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:34:06,595 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:34:06,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 21:34:06,595 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-10-15 21:34:06,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:34:06,596 INFO L85 PathProgramCache]: Analyzing trace with hash -2017136257, now seen corresponding path program 1 times [2022-10-15 21:34:06,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:34:06,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175844974] [2022-10-15 21:34:06,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:34:06,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:34:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:07,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:34:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:07,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-10-15 21:34:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:07,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-10-15 21:34:07,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:07,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-10-15 21:34:07,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:07,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-10-15 21:34:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:07,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:07,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-10-15 21:34:07,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:07,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:34:07,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:07,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-10-15 21:34:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:07,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-15 21:34:07,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:07,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-10-15 21:34:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:07,281 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-15 21:34:07,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:34:07,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175844974] [2022-10-15 21:34:07,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175844974] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:34:07,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041475844] [2022-10-15 21:34:07,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:34:07,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:34:07,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:34:07,288 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-15 21:34:07,305 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-15 21:34:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:07,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 1227 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-15 21:34:07,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:34:07,971 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-15 21:34:07,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:34:08,122 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-15 21:34:08,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041475844] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:34:08,122 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:34:08,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2022-10-15 21:34:08,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988879850] [2022-10-15 21:34:08,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:34:08,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-15 21:34:08,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:34:08,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-15 21:34:08,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:34:08,125 INFO L87 Difference]: Start difference. First operand 2851 states and 3722 transitions. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 7 states have internal predecessors, (114), 2 states have call successors, (25), 4 states have call predecessors, (25), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-10-15 21:34:10,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:34:10,063 INFO L93 Difference]: Finished difference Result 6293 states and 8332 transitions. [2022-10-15 21:34:10,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 21:34:10,064 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 7 states have internal predecessors, (114), 2 states have call successors, (25), 4 states have call predecessors, (25), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 109 [2022-10-15 21:34:10,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:34:10,143 INFO L225 Difference]: With dead ends: 6293 [2022-10-15 21:34:10,143 INFO L226 Difference]: Without dead ends: 3449 [2022-10-15 21:34:10,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-10-15 21:34:10,160 INFO L413 NwaCegarLoop]: 616 mSDtfsCounter, 461 mSDsluCounter, 2159 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 2775 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-10-15 21:34:10,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 2775 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-10-15 21:34:10,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3449 states. [2022-10-15 21:34:10,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3449 to 2854. [2022-10-15 21:34:10,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2854 states, 2215 states have (on average 1.2604966139954854) internal successors, (2792), 2275 states have internal predecessors, (2792), 439 states have call successors, (439), 159 states have call predecessors, (439), 174 states have return successors, (494), 435 states have call predecessors, (494), 439 states have call successors, (494) [2022-10-15 21:34:10,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2854 states to 2854 states and 3725 transitions. [2022-10-15 21:34:10,504 INFO L78 Accepts]: Start accepts. Automaton has 2854 states and 3725 transitions. Word has length 109 [2022-10-15 21:34:10,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:34:10,505 INFO L495 AbstractCegarLoop]: Abstraction has 2854 states and 3725 transitions. [2022-10-15 21:34:10,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 7 states have internal predecessors, (114), 2 states have call successors, (25), 4 states have call predecessors, (25), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-10-15 21:34:10,505 INFO L276 IsEmpty]: Start isEmpty. Operand 2854 states and 3725 transitions. [2022-10-15 21:34:10,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-10-15 21:34:10,511 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:34:10,512 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:34:10,561 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-15 21:34:10,726 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,SelfDestructingSolverStorable9 [2022-10-15 21:34:10,726 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-10-15 21:34:10,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:34:10,727 INFO L85 PathProgramCache]: Analyzing trace with hash -2083660959, now seen corresponding path program 2 times [2022-10-15 21:34:10,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:34:10,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861129763] [2022-10-15 21:34:10,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:34:10,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:34:11,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 21:34:11,105 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 21:34:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 21:34:11,557 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 21:34:11,557 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 21:34:11,559 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 34 remaining) [2022-10-15 21:34:11,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 34 remaining) [2022-10-15 21:34:11,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 34 remaining) [2022-10-15 21:34:11,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location index_to_minorErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 34 remaining) [2022-10-15 21:34:11,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location index_to_minorErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 34 remaining) [2022-10-15 21:34:11,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 34 remaining) [2022-10-15 21:34:11,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 34 remaining) [2022-10-15 21:34:11,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 34 remaining) [2022-10-15 21:34:11,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 34 remaining) [2022-10-15 21:34:11,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 34 remaining) [2022-10-15 21:34:11,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 34 remaining) [2022-10-15 21:34:11,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 34 remaining) [2022-10-15 21:34:11,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 34 remaining) [2022-10-15 21:34:11,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 34 remaining) [2022-10-15 21:34:11,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 34 remaining) [2022-10-15 21:34:11,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 34 remaining) [2022-10-15 21:34:11,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 34 remaining) [2022-10-15 21:34:11,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 34 remaining) [2022-10-15 21:34:11,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 34 remaining) [2022-10-15 21:34:11,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 34 remaining) [2022-10-15 21:34:11,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 34 remaining) [2022-10-15 21:34:11,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 34 remaining) [2022-10-15 21:34:11,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 34 remaining) [2022-10-15 21:34:11,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 34 remaining) [2022-10-15 21:34:11,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 34 remaining) [2022-10-15 21:34:11,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 34 remaining) [2022-10-15 21:34:11,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 34 remaining) [2022-10-15 21:34:11,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 34 remaining) [2022-10-15 21:34:11,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 34 remaining) [2022-10-15 21:34:11,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 34 remaining) [2022-10-15 21:34:11,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 34 remaining) [2022-10-15 21:34:11,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 34 remaining) [2022-10-15 21:34:11,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 34 remaining) [2022-10-15 21:34:11,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 34 remaining) [2022-10-15 21:34:11,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 21:34:11,582 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:34:11,589 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 21:34:11,635 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,640 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,642 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,642 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,645 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,645 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,650 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,653 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,653 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,653 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,654 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,654 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,654 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,654 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,654 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,655 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,655 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,655 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,655 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,659 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,659 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,659 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,659 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,660 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,660 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,660 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,660 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,660 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,662 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,662 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,662 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,662 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,663 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,663 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,663 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,663 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,667 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,668 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,668 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,668 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,668 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,668 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,669 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,669 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,669 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,669 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,670 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,670 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,670 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,671 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,671 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,671 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,671 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,674 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,675 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,675 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,675 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,675 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,676 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,676 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,676 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,676 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,677 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,677 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,679 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,679 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,679 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,679 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,679 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,680 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,680 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,680 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,680 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,680 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,681 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,681 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,685 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,685 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,685 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,685 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,689 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,689 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,689 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,690 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,690 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,690 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,690 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,691 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,691 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,691 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,691 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,691 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,692 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,692 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,692 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,692 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,693 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,693 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,693 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,693 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,693 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,694 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,694 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,694 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,694 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,694 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,695 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,695 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,695 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,695 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,695 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,696 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,696 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,697 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,697 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,697 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,697 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,697 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,698 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,698 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,698 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,698 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,698 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,699 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,701 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,701 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,701 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,701 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,702 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,703 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,703 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,703 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,703 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,704 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,705 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,705 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,705 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,705 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,706 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,706 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,706 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,706 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,707 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,707 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,707 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,707 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,708 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,708 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,708 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,708 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,708 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,709 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,711 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,711 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,712 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,712 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,713 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,713 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,713 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,713 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,713 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,714 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,714 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,715 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,715 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,715 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,715 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,716 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,716 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,716 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,716 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,717 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,717 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,718 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,718 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,718 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,719 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,720 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,720 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,720 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,721 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,721 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,721 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,721 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,722 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,722 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,722 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,722 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,723 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,723 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,723 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,723 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,724 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,724 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,724 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,724 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,725 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,725 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,725 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,726 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,726 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,727 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,727 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-10-15 21:34:11,727 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-10-15 21:34:11,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 09:34:11 BoogieIcfgContainer [2022-10-15 21:34:11,879 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 21:34:11,880 INFO L158 Benchmark]: Toolchain (without parser) took 30614.74ms. Allocated memory was 154.1MB in the beginning and 524.3MB in the end (delta: 370.1MB). Free memory was 121.9MB in the beginning and 170.2MB in the end (delta: -48.3MB). Peak memory consumption was 322.4MB. Max. memory is 8.0GB. [2022-10-15 21:34:11,880 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 154.1MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 21:34:11,880 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1906.76ms. Allocated memory is still 154.1MB. Free memory was 121.8MB in the beginning and 54.7MB in the end (delta: 67.1MB). Peak memory consumption was 67.8MB. Max. memory is 8.0GB. [2022-10-15 21:34:11,881 INFO L158 Benchmark]: Boogie Procedure Inliner took 286.28ms. Allocated memory is still 154.1MB. Free memory was 54.7MB in the beginning and 113.3MB in the end (delta: -58.6MB). Peak memory consumption was 23.2MB. Max. memory is 8.0GB. [2022-10-15 21:34:11,881 INFO L158 Benchmark]: Boogie Preprocessor took 300.41ms. Allocated memory was 154.1MB in the beginning and 226.5MB in the end (delta: 72.4MB). Free memory was 113.3MB in the beginning and 179.8MB in the end (delta: -66.5MB). Peak memory consumption was 15.8MB. Max. memory is 8.0GB. [2022-10-15 21:34:11,881 INFO L158 Benchmark]: RCFGBuilder took 2557.39ms. Allocated memory is still 226.5MB. Free memory was 179.8MB in the beginning and 120.6MB in the end (delta: 59.2MB). Peak memory consumption was 60.8MB. Max. memory is 8.0GB. [2022-10-15 21:34:11,882 INFO L158 Benchmark]: TraceAbstraction took 25547.22ms. Allocated memory was 226.5MB in the beginning and 524.3MB in the end (delta: 297.8MB). Free memory was 119.6MB in the beginning and 170.2MB in the end (delta: -50.7MB). Peak memory consumption was 247.1MB. Max. memory is 8.0GB. [2022-10-15 21:34:11,885 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.28ms. Allocated memory is still 154.1MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1906.76ms. Allocated memory is still 154.1MB. Free memory was 121.8MB in the beginning and 54.7MB in the end (delta: 67.1MB). Peak memory consumption was 67.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 286.28ms. Allocated memory is still 154.1MB. Free memory was 54.7MB in the beginning and 113.3MB in the end (delta: -58.6MB). Peak memory consumption was 23.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 300.41ms. Allocated memory was 154.1MB in the beginning and 226.5MB in the end (delta: 72.4MB). Free memory was 113.3MB in the beginning and 179.8MB in the end (delta: -66.5MB). Peak memory consumption was 15.8MB. Max. memory is 8.0GB. * RCFGBuilder took 2557.39ms. Allocated memory is still 226.5MB. Free memory was 179.8MB in the beginning and 120.6MB in the end (delta: 59.2MB). Peak memory consumption was 60.8MB. Max. memory is 8.0GB. * TraceAbstraction took 25547.22ms. Allocated memory was 226.5MB in the beginning and 524.3MB in the end (delta: 297.8MB). Free memory was 119.6MB in the beginning and 170.2MB in the end (delta: -50.7MB). Peak memory consumption was 247.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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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 * 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: 4487]: 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 4266. Possible FailurePath: [L3592] int LDV_IN_INTERRUPT = 1; [L3593] struct block_device *virtblk_fops_group0 ; [L3594] int ldv_state_variable_2 ; [L3595] int ref_cnt ; [L3596] int ldv_state_variable_1 ; [L3597] struct virtio_device *virtio_blk_group0 ; [L3598] int ldv_state_variable_0 ; [L3729] static int major ; [L3730] static int index ; [L4055-L4056] static struct block_device_operations const virtblk_fops = {0, 0, & virtblk_ioctl, 0, 0, 0, 0, 0, 0, & virtblk_getgeo, 0, & __this_module}; [L4254-L4255] static struct virtio_device_id const id_table[2U] = { {2U, 4294967295U}, {0U, 0U}}; [L4256-L4259] static unsigned int features[9U] = { 0U, 2U, 1U, 4U, 5U, 6U, 7U, 9U, 10U}; [L4260-L4261] 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}; [L4283] struct virtio_device_id const __mod_virtio_device_table ; [L4284] int ldv_retval_0 ; [L4285] int ldv_retval_1 ; [L4522] int ldv_blk_rq = 0; VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, features={14:0}, id_table={13: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={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L4308] unsigned long ldvarg1 ; [L4309] unsigned long tmp ; [L4310] fmode_t ldvarg3 ; [L4311] struct hd_geometry *ldvarg0 ; [L4312] void *tmp___0 ; [L4313] unsigned int ldvarg2 ; [L4314] unsigned int tmp___1 ; [L4315] int tmp___2 ; [L4316] int tmp___3 ; [L4317] int tmp___4 ; [L4318] int tmp___5 ; [L4320] tmp = __VERIFIER_nondet_ulong() [L4321] ldvarg1 = tmp VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, features={14:0}, id_table={13: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=9, ldvarg3={19:0}, major=0, ref_cnt=0, tmp=9, virtblk_fops={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L4322] CALL, EXPR ldv_zalloc(16UL) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, features={14:0}, id_table={13: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={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L3533] void *p ; [L3534] void *tmp ; [L3535] int tmp___0 ; [L3537] tmp___0 = __VERIFIER_nondet_int() [L3538] COND TRUE tmp___0 != 0 [L3539] return ((void *)0); VAL [\old(size)=16, \result={0:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, features={14:0}, id_table={13: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, tmp___0=-3, virtblk_fops={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L4322] RET, EXPR ldv_zalloc(16UL) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, features={14:0}, id_table={13: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, ldv_zalloc(16UL)={0:0}, ldvarg1=9, ldvarg3={19:0}, major=0, ref_cnt=0, tmp=9, virtblk_fops={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L4322] tmp___0 = ldv_zalloc(16UL) [L4323] ldvarg0 = (struct hd_geometry *)tmp___0 [L4324] tmp___1 = __VERIFIER_nondet_uint() [L4325] ldvarg2 = tmp___1 [L4326] FCALL ldv_initialize() [L4327] FCALL memset((void *)(& ldvarg3), 0, 4UL) [L4328] ldv_state_variable_1 = 0 [L4329] ref_cnt = 0 [L4330] ldv_state_variable_0 = 1 [L4331] ldv_state_variable_2 = 0 VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, features={14:0}, id_table={13: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={0:0}, ldvarg1=9, ldvarg2=18, ldvarg3={19:0}, major=0, ref_cnt=0, tmp=9, tmp___0={0:0}, tmp___1=18, virtblk_fops={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L4333] tmp___2 = __VERIFIER_nondet_int() [L4335] case 0: [L4365] case 1: VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, features={14:0}, id_table={13: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={0:0}, ldvarg1=9, ldvarg2=18, ldvarg3={19:0}, major=0, ref_cnt=0, tmp=9, tmp___0={0:0}, tmp___1=18, tmp___2=1, virtblk_fops={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L4366] COND TRUE ldv_state_variable_0 != 0 [L4367] tmp___4 = __VERIFIER_nondet_int() [L4369] case 0: [L4377] case 1: VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, features={14:0}, id_table={13: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={0:0}, ldvarg1=9, ldvarg2=18, ldvarg3={19:0}, major=0, ref_cnt=0, tmp=9, tmp___0={0:0}, tmp___1=18, tmp___2=1, tmp___4=1, virtblk_fops={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L4378] COND TRUE ldv_state_variable_0 == 1 [L4379] CALL, EXPR init() [L4264] int tmp ; [L4266] CALL, EXPR register_blkdev(0U, "virtblk") [L4722] return __VERIFIER_nondet_int(); [L4266] RET, EXPR register_blkdev(0U, "virtblk") [L4266] major = register_blkdev(0U, "virtblk") [L4267] COND FALSE !(major < 0) [L4271] CALL, EXPR register_virtio_driver(& virtio_blk) [L4726] return __VERIFIER_nondet_int(); [L4271] RET, EXPR register_virtio_driver(& virtio_blk) [L4271] tmp = register_virtio_driver(& virtio_blk) [L4272] return (tmp); VAL [\result=0, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, features={14:0}, id_table={13: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={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L4379] RET, EXPR init() [L4379] ldv_retval_1 = init() [L4380] COND TRUE ldv_retval_1 == 0 [L4381] ldv_state_variable_0 = 3 [L4382] ldv_state_variable_2 = 1 [L4383] CALL ldv_initialize_block_device_operations_2() [L4299] void *tmp ; VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, features={14:0}, id_table={13: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={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L4301] CALL, EXPR ldv_zalloc(464UL) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, features={14:0}, id_table={13: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={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L3533] void *p ; [L3534] void *tmp ; [L3535] int tmp___0 ; [L3537] tmp___0 = __VERIFIER_nondet_int() [L3538] COND TRUE tmp___0 != 0 [L3539] return ((void *)0); VAL [\old(size)=464, \result={0:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, features={14:0}, id_table={13: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, tmp___0=-4, virtblk_fops={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L4301] RET, EXPR ldv_zalloc(464UL) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, features={14:0}, id_table={13: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, ldv_zalloc(464UL)={0:0}, major=0, ref_cnt=0, virtblk_fops={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L4301] tmp = ldv_zalloc(464UL) [L4302] virtblk_fops_group0 = (struct block_device *)tmp VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, features={14:0}, id_table={13: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={0:0}, virtblk_fops={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L4383] RET ldv_initialize_block_device_operations_2() [L4384] ldv_state_variable_1 = 1 [L4385] CALL ldv_initialize_virtio_driver_1() [L4290] void *tmp ; VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, features={14:0}, id_table={13: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={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L4292] CALL, EXPR ldv_zalloc(1048UL) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, features={14:0}, id_table={13: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={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L3533] void *p ; [L3534] void *tmp ; [L3535] int tmp___0 ; [L3537] tmp___0 = __VERIFIER_nondet_int() [L3538] COND TRUE tmp___0 != 0 [L3539] return ((void *)0); VAL [\old(size)=1048, \result={0:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, features={14:0}, id_table={13: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, tmp___0=-5, virtblk_fops={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L4292] RET, EXPR ldv_zalloc(1048UL) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, features={14:0}, id_table={13: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, ldv_zalloc(1048UL)={0:0}, major=0, ref_cnt=0, virtblk_fops={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L4292] tmp = ldv_zalloc(1048UL) [L4293] virtio_blk_group0 = (struct virtio_device *)tmp VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, features={14:0}, id_table={13: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:0}, virtblk_fops={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L4385] RET ldv_initialize_virtio_driver_1() [L4388] COND FALSE !(ldv_retval_1 != 0) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, features={14:0}, id_table={13: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={0:0}, ldvarg1=9, ldvarg2=18, ldvarg3={19:0}, major=0, ref_cnt=0, tmp=9, tmp___0={0:0}, tmp___1=18, tmp___2=1, tmp___4=1, virtblk_fops={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L4333] tmp___2 = __VERIFIER_nondet_int() [L4335] case 0: VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, features={14:0}, id_table={13: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={0:0}, ldvarg1=9, ldvarg2=18, ldvarg3={19:0}, major=0, ref_cnt=0, tmp=9, tmp___0={0:0}, tmp___1=18, tmp___2=0, tmp___4=1, virtblk_fops={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L4336] COND TRUE ldv_state_variable_1 != 0 [L4337] tmp___3 = __VERIFIER_nondet_int() [L4339] case 0: VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, features={14:0}, id_table={13: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={0:0}, ldvarg1=9, ldvarg2=18, ldvarg3={19:0}, major=0, ref_cnt=0, tmp=9, tmp___0={0:0}, tmp___1=18, tmp___2=0, tmp___3=0, tmp___4=1, virtblk_fops={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L4340] COND TRUE ldv_state_variable_1 == 1 [L4341] CALL virtblk_probe(virtio_blk_group0) [L4065] struct virtio_blk *vblk ; [L4066] struct request_queue *q ; [L4067] int err ; [L4068] u64 cap ; [L4069] u32 v ; [L4070] u32 blk_size ; [L4071] u32 sg_elems ; [L4072] u32 opt_io_size ; [L4073] u16 min_io_size ; [L4074] u8 physical_block_exp ; [L4075] u8 alignment_offset ; [L4076] int tmp ; [L4077] void *tmp___0 ; [L4078] struct lock_class_key __key ; [L4079] long tmp___1 ; [L4080] long tmp___2 ; [L4081] struct request_queue *tmp___3 ; [L4082] unsigned int m1 ; [L4083] unsigned int m2 ; [L4084] unsigned int m3 ; [L4085] bool tmp___4 ; [L4086] bool tmp___5 ; [L4087] bool tmp___6 ; [L4088] unsigned short tmp___9 ; VAL [__key={34:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, alignment_offset={26:0}, blk_size={27:0}, cap={31:0}, features={14:0}, id_table={13: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={35:0}, opt_io_size={30:0}, physical_block_exp={39:0}, ref_cnt=0, sg_elems={23:0}, v={38:0}, vdev={0:0}, vdev={0:0}, virtblk_fops={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L4090] CALL, EXPR index_to_minor(index) VAL [\old(index___0)=0, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, features={14:0}, id_table={13: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={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L4060] EXPR index___0 << 4 [L4060] return (index___0 << 4); VAL [\old(index___0)=0, \result=0, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, features={14:0}, id_table={13: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={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L4090] RET, EXPR index_to_minor(index) VAL [__key={34:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, alignment_offset={26:0}, blk_size={27:0}, cap={31:0}, features={14:0}, id_table={13: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={35:0}, opt_io_size={30:0}, physical_block_exp={39:0}, ref_cnt=0, sg_elems={23:0}, v={38:0}, vdev={0:0}, vdev={0:0}, virtblk_fops={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L4090] tmp = index_to_minor(index) [L4091] COND FALSE !(tmp > 1048575) VAL [__key={34:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, alignment_offset={26:0}, blk_size={27:0}, cap={31:0}, features={14:0}, id_table={13: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={35:0}, opt_io_size={30:0}, physical_block_exp={39:0}, ref_cnt=0, sg_elems={23:0}, tmp=0, v={38:0}, vdev={0:0}, vdev={0:0}, virtblk_fops={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L4095] 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={4294967299:4294967303}, buf={23:0}, features={14:0}, id_table={13: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={0:0}, virtblk_fops={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L3689] bool tmp ; [L3690] 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={4294967299:4294967303}, buf={23:0}, buf={23:0}, fbit=2, features={14:0}, id_table={13: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={0:0}, vdev={0:0}, virtblk_fops={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L3692] 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={4294967299:4294967303}, features={14:0}, id_table={13: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={0:0}, virtblk_fops={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L3676] int tmp ; VAL [\old(fbit)=2, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, fbit=2, features={14:0}, id_table={13: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={0:0}, vdev={0:0}, virtblk_fops={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L3678] COND TRUE fbit <= 27U [L3679] FCALL virtio_check_driver_offered_feature(vdev, fbit) [L3682] 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={4294967299:4294967303}, addr={0:575}, addr={0:575}, features={14:0}, id_table={13: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={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L3682] RET, EXPR variable_test_bit((int )fbit, (unsigned long const volatile *)(& vdev->features)) [L3682] tmp = variable_test_bit((int )fbit, (unsigned long const volatile *)(& vdev->features)) [L3683] return (tmp != 0); VAL [\old(fbit)=2, \result=0, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, fbit=2, features={14:0}, id_table={13: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={0:0}, vdev={0:0}, virtblk_fops={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L3692] 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={4294967299:4294967303}, buf={23:0}, buf={23:0}, fbit=2, features={14:0}, id_table={13: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={0:0}, vdev={0:0}, virtblk_fops={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}, virtio_has_feature((struct virtio_device const *)vdev, fbit)=0] [L3692] tmp = virtio_has_feature((struct virtio_device const *)vdev, fbit) [L3693] COND FALSE !(\read(tmp)) [L3696] 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={4294967299:4294967303}, buf={23:0}, buf={23:0}, fbit=2, features={14:0}, id_table={13: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={0:0}, vdev={0:0}, virtblk_fops={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L3698] COND TRUE \read(tmp___0) [L3699] 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={4294967299:4294967303}, buf={23:0}, buf={23:0}, fbit=2, features={14:0}, id_table={13: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={0:0}, vdev={0:0}, virtblk_fops={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L4095] RET, EXPR virtio_config_buf(vdev, 2U, 12U, (void *)(& sg_elems), 4U) VAL [__key={34:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, alignment_offset={26:0}, blk_size={27:0}, cap={31:0}, features={14:0}, id_table={13: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={35:0}, opt_io_size={30:0}, physical_block_exp={39:0}, ref_cnt=0, sg_elems={23:0}, tmp=0, v={38:0}, vdev={0:0}, vdev={0:0}, virtblk_fops={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}, virtio_config_buf(vdev, 2U, 12U, (void *)(& sg_elems), 4U)=-2] [L4095] err = virtio_config_buf(vdev, 2U, 12U, (void *)(& sg_elems), 4U) [L4096] err != 0 || sg_elems == 0U VAL [__key={34:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, alignment_offset={26:0}, blk_size={27:0}, cap={31:0}, err=-2, err != 0 || sg_elems == 0U=1, features={14:0}, id_table={13: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={35:0}, opt_io_size={30:0}, physical_block_exp={39:0}, ref_cnt=0, sg_elems={23:0}, tmp=0, v={38:0}, vdev={0:0}, vdev={0:0}, virtblk_fops={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L4096] COND TRUE err != 0 || sg_elems == 0U [L4097] sg_elems = 1U VAL [__key={34:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, alignment_offset={26:0}, blk_size={27:0}, cap={31:0}, err=-2, features={14:0}, id_table={13: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={35:0}, opt_io_size={30:0}, physical_block_exp={39:0}, ref_cnt=0, sg_elems={23:0}, tmp=0, v={38:0}, vdev={0:0}, vdev={0:0}, virtblk_fops={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L4100] EXPR \read(sg_elems) [L4100] sg_elems = sg_elems + 2U [L4101] EXPR \read(sg_elems) [L4101] CALL, EXPR kmalloc((unsigned long )sg_elems * 40UL + 120UL, 208U) [L3472] void *ret ; [L3473] void *tmp ; [L3474] struct kmem_cache *s ; [L3475] struct kmem_cache *tmp___0 ; [L3476] void *tmp___1 ; VAL [\old(flags)=208, \old(size)=240, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, features={14:0}, flags=208, id_table={13: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, virtblk_fops={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L3478] COND FALSE !(0) VAL [\old(flags)=208, \old(size)=240, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, features={14:0}, flags=208, id_table={13: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, virtblk_fops={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L3499] CALL, EXPR __kmalloc(size, flags) [L3449] CALL, EXPR ldv_malloc(size) VAL [\old(size)=240, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, features={14:0}, id_table={13: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={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L3515] void *p ; [L3516] void *tmp ; [L3517] int tmp___0 ; [L3519] tmp___0 = __VERIFIER_nondet_int() [L3520] COND FALSE !(tmp___0 != 0) [L3523] tmp = malloc(size) [L3524] p = tmp VAL [\old(size)=240, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, features={14:0}, id_table={13: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={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L3525] 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={4294967299:4294967303}, features={14:0}, id_table={13: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={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L3510] COND FALSE !(!cond) VAL [\old(cond)=1, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, cond=1, features={14:0}, id_table={13: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={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L3525] 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={4294967299:4294967303}, features={14:0}, id_table={13: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={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L3526] CALL, EXPR ldv_is_err(p) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, features={14:0}, id_table={13: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={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L4481] return ((unsigned long )ptr > 2012UL); VAL [\result=0, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, features={14:0}, id_table={13: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={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L3526] RET, EXPR ldv_is_err(p) VAL [\old(size)=240, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, features={14:0}, id_table={13:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_is_err(p)=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, p={-4294965284:0}, ref_cnt=0, size=240, tmp={-4294965284:0}, tmp___0=0, virtblk_fops={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L3526] CALL assume_abort_if_not(ldv_is_err(p) == 0) VAL [\old(cond)=1, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, features={14:0}, id_table={13: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={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L3510] COND FALSE !(!cond) VAL [\old(cond)=1, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, cond=1, features={14:0}, id_table={13: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={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L3526] RET assume_abort_if_not(ldv_is_err(p) == 0) VAL [\old(size)=240, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, features={14:0}, id_table={13:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_is_err(p)=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, p={-4294965284:0}, ref_cnt=0, size=240, tmp={-4294965284:0}, tmp___0=0, virtblk_fops={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L3527] return (p); VAL [\old(size)=240, \result={-4294965284:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, features={14:0}, id_table={13: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={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L3449] RET, EXPR ldv_malloc(size) VAL [\old(size)=240, \old(t)=208, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, features={14:0}, id_table={13: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={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L3449] return ldv_malloc(size); [L3499] RET, EXPR __kmalloc(size, flags) [L3499] tmp___1 = __kmalloc(size, flags) [L3500] 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={4294967299:4294967303}, features={14:0}, flags=208, id_table={13: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={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L4101] RET, EXPR kmalloc((unsigned long )sg_elems * 40UL + 120UL, 208U) [L4101] tmp___0 = kmalloc((unsigned long )sg_elems * 40UL + 120UL, 208U) [L4102] vblk = (struct virtio_blk *)tmp___0 [L4103] vdev->priv = (void *)vblk VAL [__key={34:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, alignment_offset={26:0}, blk_size={27:0}, cap={31:0}, err=-2, features={14:0}, id_table={13: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={35:0}, opt_io_size={30:0}, physical_block_exp={39:0}, ref_cnt=0, sg_elems={23:0}, tmp=0, tmp___0={-4294965284:0}, v={38:0}, vblk={-4294965284:0}, vdev={0:0}, vdev={0:0}, virtblk_fops={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L4104] COND FALSE !((unsigned long )vblk == (unsigned long )((struct virtio_blk *)0)) [L4109] CALL INIT_LIST_HEAD(& vblk->reqs) [L3126] list->next = list [L3127] list->prev = list VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, features={14:0}, id_table={13: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={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L4109] RET INIT_LIST_HEAD(& vblk->reqs) [L4110] CALL spinlock_check(& vblk->lock) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, features={14:0}, id_table={13: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={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L3153] return (& lock->ldv_5847.rlock); VAL [\result={-4294965284:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, features={14:0}, id_table={13: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={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L4110] RET spinlock_check(& vblk->lock) VAL [__key={34:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, alignment_offset={26:0}, blk_size={27:0}, cap={31:0}, err=-2, features={14:0}, id_table={13: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={35:0}, opt_io_size={30:0}, physical_block_exp={39:0}, ref_cnt=0, sg_elems={23:0}, spinlock_check(& vblk->lock)={-4294965284:0}, tmp=0, tmp___0={-4294965284:0}, v={38:0}, vblk={-4294965284:0}, vdev={0:0}, vdev={0:0}, virtblk_fops={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] [L4111] FCALL __raw_spin_lock_init(& vblk->lock.ldv_5847.rlock, "&(&vblk->lock)->rlock", & __key) [L4112] vblk->vdev = vdev [L4113] EXPR \read(sg_elems) [L4113] vblk->sg_elems = sg_elems [L4114] EXPR vblk->sg_elems [L4114] FCALL sg_init_table((struct scatterlist *)(& vblk->sg), vblk->sg_elems) [L4115] CALL virtio_find_single_vq(vdev, & blk_done, "requests") [L3709] vq_callback_t *callbacks[1U] ; [L3710] char const *names[1U] ; [L3711] struct virtqueue *vq ; [L3712] int err ; [L3713] int tmp ; [L3714] void *tmp___0 ; [L3716] callbacks[0] = c [L3717] names[0] = n [L3718] EXPR vdev->config [L3718] EXPR (vdev->config)->find_vqs [L3718-L3719] EXPR, FCALL (*((vdev->config)->find_vqs))(vdev, 1U, & vq, (vq_callback_t **)(& callbacks), (char const **)(& names)) [L3718-L3719] tmp = (*((vdev->config)->find_vqs))(vdev, 1U, & vq, (vq_callback_t **)(& callbacks), (char const **)(& names)) [L3720] err = tmp VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, c={-1:4}, c={-1:4}, callbacks={42:0}, err=-2147481636, features={14:0}, id_table={13: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={5:0}, n={5:0}, names={18:0}, ref_cnt=0, tmp=-2147481636, vdev={0:0}, vdev={0:0}, virtblk_fops={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}, vq={43:0}] [L3721] COND TRUE err < 0 [L3722] CALL ERR_PTR((long )err) [L4440] void *tmp ; [L4442] CALL ldv_err_ptr(error) [L4487] 2012L - error VAL [\old(error)=-2147481636, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967299:4294967303}, error=-2147481636, features={14:0}, id_table={13: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={12:0}, virtblk_fops_group0={0:0}, virtio_blk={15:0}, virtio_blk_group0={0:0}] - 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: 4060]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4060]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3111]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3111]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4487]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4148]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4148]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4148]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4148]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4148]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4148]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4150]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4150]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4150]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4150]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4150]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4150]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4150]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4150]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4151]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4151]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4151]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4151]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4160]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4160]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4344]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4344]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4354]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4354]: 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 28 procedures, 588 locations, 34 error locations. Started 1 CEGAR loops. OverallTime: 25.2s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 15.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5334 SdHoareTripleChecker+Valid, 10.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4955 mSDsluCounter, 24744 SdHoareTripleChecker+Invalid, 9.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17689 mSDsCounter, 1781 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7194 IncrementalHoareTripleChecker+Invalid, 8975 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1781 mSolverCounterUnsat, 7055 mSDtfsCounter, 7194 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 415 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2854occurred in iteration=10, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 7412 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 988 NumberOfCodeBlocks, 988 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 973 ConstructedInterpolants, 0 QuantifiedInterpolants, 1579 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1227 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 188/191 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-15 21:34:11,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...