./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8946ad2f029076f7c4f90de60a8c48e069f80fec06a0c6d7a5dc3a1fc4182879 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 11:38:36,163 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 11:38:36,165 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 11:38:36,196 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 11:38:36,196 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 11:38:36,197 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 11:38:36,200 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 11:38:36,202 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 11:38:36,204 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 11:38:36,207 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 11:38:36,208 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 11:38:36,212 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 11:38:36,212 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 11:38:36,214 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 11:38:36,214 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 11:38:36,217 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 11:38:36,218 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 11:38:36,219 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 11:38:36,220 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 11:38:36,225 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 11:38:36,226 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 11:38:36,227 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 11:38:36,228 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 11:38:36,229 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 11:38:36,230 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 11:38:36,235 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 11:38:36,235 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 11:38:36,235 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 11:38:36,236 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 11:38:36,236 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 11:38:36,237 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 11:38:36,237 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 11:38:36,238 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 11:38:36,239 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 11:38:36,240 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 11:38:36,240 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 11:38:36,240 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 11:38:36,241 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 11:38:36,241 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 11:38:36,241 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 11:38:36,242 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 11:38:36,243 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 11:38:36,247 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-21 11:38:36,279 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 11:38:36,279 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 11:38:36,280 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 11:38:36,280 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 11:38:36,280 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 11:38:36,281 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 11:38:36,281 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 11:38:36,281 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 11:38:36,281 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 11:38:36,282 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 11:38:36,282 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 11:38:36,282 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 11:38:36,283 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 11:38:36,283 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 11:38:36,283 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 11:38:36,283 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 11:38:36,283 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 11:38:36,283 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 11:38:36,284 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 11:38:36,284 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 11:38:36,284 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 11:38:36,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 11:38:36,284 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 11:38:36,284 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 11:38:36,285 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 11:38:36,285 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 11:38:36,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 11:38:36,285 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 11:38:36,285 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 11:38:36,285 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 11:38:36,286 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8946ad2f029076f7c4f90de60a8c48e069f80fec06a0c6d7a5dc3a1fc4182879 [2022-07-21 11:38:36,561 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 11:38:36,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 11:38:36,578 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 11:38:36,579 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 11:38:36,579 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 11:38:36,580 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-07-21 11:38:36,634 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39dc4cfde/f9aca5aed9c943289abe29f0438cc8ed/FLAGf24aaa58f [2022-07-21 11:38:37,202 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 11:38:37,203 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-07-21 11:38:37,223 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39dc4cfde/f9aca5aed9c943289abe29f0438cc8ed/FLAGf24aaa58f [2022-07-21 11:38:37,605 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39dc4cfde/f9aca5aed9c943289abe29f0438cc8ed [2022-07-21 11:38:37,616 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 11:38:37,617 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 11:38:37,618 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 11:38:37,618 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 11:38:37,620 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 11:38:37,621 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:38:37" (1/1) ... [2022-07-21 11:38:37,622 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6edffa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:38:37, skipping insertion in model container [2022-07-21 11:38:37,622 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:38:37" (1/1) ... [2022-07-21 11:38:37,627 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 11:38:37,680 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 11:38:38,551 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i[121503,121516] [2022-07-21 11:38:38,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 11:38:38,597 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 11:38:38,788 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i[121503,121516] [2022-07-21 11:38:38,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 11:38:38,829 INFO L208 MainTranslator]: Completed translation [2022-07-21 11:38:38,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:38:38 WrapperNode [2022-07-21 11:38:38,831 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 11:38:38,832 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 11:38:38,832 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 11:38:38,832 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 11:38:38,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:38:38" (1/1) ... [2022-07-21 11:38:38,882 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:38:38" (1/1) ... [2022-07-21 11:38:38,961 INFO L137 Inliner]: procedures = 142, calls = 521, calls flagged for inlining = 83, calls inlined = 83, statements flattened = 1668 [2022-07-21 11:38:38,961 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 11:38:38,962 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 11:38:38,962 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 11:38:38,962 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 11:38:38,968 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:38:38" (1/1) ... [2022-07-21 11:38:38,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:38:38" (1/1) ... [2022-07-21 11:38:38,985 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:38:38" (1/1) ... [2022-07-21 11:38:38,986 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:38:38" (1/1) ... [2022-07-21 11:38:39,057 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:38:38" (1/1) ... [2022-07-21 11:38:39,063 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:38:38" (1/1) ... [2022-07-21 11:38:39,077 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:38:38" (1/1) ... [2022-07-21 11:38:39,088 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 11:38:39,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 11:38:39,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 11:38:39,095 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 11:38:39,096 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:38:38" (1/1) ... [2022-07-21 11:38:39,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 11:38:39,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:38:39,121 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-07-21 11:38:39,129 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-07-21 11:38:39,158 INFO L130 BoogieDeclarations]: Found specification of procedure blk_queue_max_segment_size [2022-07-21 11:38:39,158 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_queue_max_segment_size [2022-07-21 11:38:39,158 INFO L130 BoogieDeclarations]: Found specification of procedure virtio_config_buf [2022-07-21 11:38:39,158 INFO L138 BoogieDeclarations]: Found implementation of procedure virtio_config_buf [2022-07-21 11:38:39,158 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-21 11:38:39,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-21 11:38:39,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 11:38:39,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-21 11:38:39,159 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-21 11:38:39,159 INFO L130 BoogieDeclarations]: Found specification of procedure req_get_ioprio [2022-07-21 11:38:39,159 INFO L138 BoogieDeclarations]: Found implementation of procedure req_get_ioprio [2022-07-21 11:38:39,159 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~TO~VOID [2022-07-21 11:38:39,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~TO~VOID [2022-07-21 11:38:39,160 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-21 11:38:39,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-21 11:38:39,160 INFO L130 BoogieDeclarations]: Found specification of procedure mempool_free [2022-07-21 11:38:39,160 INFO L138 BoogieDeclarations]: Found implementation of procedure mempool_free [2022-07-21 11:38:39,160 INFO L130 BoogieDeclarations]: Found specification of procedure sg_set_buf [2022-07-21 11:38:39,160 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_set_buf [2022-07-21 11:38:39,160 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-21 11:38:39,160 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-21 11:38:39,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 11:38:39,161 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-21 11:38:39,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-21 11:38:39,161 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-21 11:38:39,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-21 11:38:39,161 INFO L130 BoogieDeclarations]: Found specification of procedure index_to_minor [2022-07-21 11:38:39,161 INFO L138 BoogieDeclarations]: Found implementation of procedure index_to_minor [2022-07-21 11:38:39,161 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-07-21 11:38:39,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-07-21 11:38:39,161 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-21 11:38:39,162 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-21 11:38:39,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 11:38:39,162 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2022-07-21 11:38:39,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2022-07-21 11:38:39,162 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-21 11:38:39,162 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-21 11:38:39,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 11:38:39,163 INFO L130 BoogieDeclarations]: Found specification of procedure virtio_has_feature [2022-07-21 11:38:39,163 INFO L138 BoogieDeclarations]: Found implementation of procedure virtio_has_feature [2022-07-21 11:38:39,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 11:38:39,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 11:38:39,163 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-21 11:38:39,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-21 11:38:39,164 INFO L130 BoogieDeclarations]: Found specification of procedure virtblk_remove [2022-07-21 11:38:39,164 INFO L138 BoogieDeclarations]: Found implementation of procedure virtblk_remove [2022-07-21 11:38:39,164 INFO L130 BoogieDeclarations]: Found specification of procedure mempool_destroy [2022-07-21 11:38:39,164 INFO L138 BoogieDeclarations]: Found implementation of procedure mempool_destroy [2022-07-21 11:38:39,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 11:38:39,164 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2022-07-21 11:38:39,164 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2022-07-21 11:38:39,165 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-21 11:38:39,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-21 11:38:39,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 11:38:39,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 11:38:39,165 INFO L130 BoogieDeclarations]: Found specification of procedure put_disk [2022-07-21 11:38:39,166 INFO L138 BoogieDeclarations]: Found implementation of procedure put_disk [2022-07-21 11:38:39,166 INFO L130 BoogieDeclarations]: Found specification of procedure blk_queue_ordered [2022-07-21 11:38:39,166 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_queue_ordered [2022-07-21 11:38:39,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 11:38:39,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 11:38:39,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 11:38:39,167 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-07-21 11:38:39,167 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-07-21 11:38:39,487 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 11:38:39,489 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 11:38:39,888 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-21 11:38:40,386 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 11:38:40,394 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 11:38:40,394 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 11:38:40,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:38:40 BoogieIcfgContainer [2022-07-21 11:38:40,396 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 11:38:40,398 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 11:38:40,398 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 11:38:40,400 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 11:38:40,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 11:38:37" (1/3) ... [2022-07-21 11:38:40,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@125fc1ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 11:38:40, skipping insertion in model container [2022-07-21 11:38:40,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:38:38" (2/3) ... [2022-07-21 11:38:40,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@125fc1ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 11:38:40, skipping insertion in model container [2022-07-21 11:38:40,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:38:40" (3/3) ... [2022-07-21 11:38:40,402 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-07-21 11:38:40,412 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 11:38:40,413 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 11:38:40,454 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 11:38:40,459 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=PETRI_NET, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@35abab99, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@41797bdd [2022-07-21 11:38:40,459 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 11:38:40,464 INFO L276 IsEmpty]: Start isEmpty. Operand has 463 states, 352 states have (on average 1.2982954545454546) internal successors, (457), 364 states have internal predecessors, (457), 84 states have call successors, (84), 26 states have call predecessors, (84), 25 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2022-07-21 11:38:40,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-21 11:38:40,472 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:38:40,472 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:38:40,473 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:38:40,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:38:40,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1450174539, now seen corresponding path program 1 times [2022-07-21 11:38:40,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:38:40,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447218024] [2022-07-21 11:38:40,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:38:40,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:38:40,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:40,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:38:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:40,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:40,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:40,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-21 11:38:40,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:40,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 11:38:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:40,840 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-21 11:38:40,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:38:40,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447218024] [2022-07-21 11:38:40,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447218024] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:38:40,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:38:40,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 11:38:40,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094948288] [2022-07-21 11:38:40,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:38:40,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 11:38:40,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:38:40,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 11:38:40,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 11:38:40,881 INFO L87 Difference]: Start difference. First operand has 463 states, 352 states have (on average 1.2982954545454546) internal successors, (457), 364 states have internal predecessors, (457), 84 states have call successors, (84), 26 states have call predecessors, (84), 25 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 11:38:41,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:38:41,658 INFO L93 Difference]: Finished difference Result 1020 states and 1424 transitions. [2022-07-21 11:38:41,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 11:38:41,660 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2022-07-21 11:38:41,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:38:41,673 INFO L225 Difference]: With dead ends: 1020 [2022-07-21 11:38:41,674 INFO L226 Difference]: Without dead ends: 542 [2022-07-21 11:38:41,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-21 11:38:41,681 INFO L413 NwaCegarLoop]: 579 mSDtfsCounter, 294 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 11:38:41,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 1199 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 11:38:41,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2022-07-21 11:38:41,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 445. [2022-07-21 11:38:41,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 341 states have (on average 1.2609970674486803) internal successors, (430), 346 states have internal predecessors, (430), 79 states have call successors, (79), 25 states have call predecessors, (79), 24 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2022-07-21 11:38:41,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 586 transitions. [2022-07-21 11:38:41,758 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 586 transitions. Word has length 46 [2022-07-21 11:38:41,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:38:41,759 INFO L495 AbstractCegarLoop]: Abstraction has 445 states and 586 transitions. [2022-07-21 11:38:41,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 11:38:41,759 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 586 transitions. [2022-07-21 11:38:41,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-21 11:38:41,764 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:38:41,765 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:38:41,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 11:38:41,765 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:38:41,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:38:41,766 INFO L85 PathProgramCache]: Analyzing trace with hash 606169037, now seen corresponding path program 1 times [2022-07-21 11:38:41,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:38:41,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203807282] [2022-07-21 11:38:41,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:38:41,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:38:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:41,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:38:41,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:41,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:41,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:41,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-21 11:38:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:41,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 11:38:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:41,902 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-21 11:38:41,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:38:41,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203807282] [2022-07-21 11:38:41,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203807282] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:38:41,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:38:41,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 11:38:41,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265025571] [2022-07-21 11:38:41,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:38:41,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 11:38:41,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:38:41,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 11:38:41,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 11:38:41,905 INFO L87 Difference]: Start difference. First operand 445 states and 586 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-21 11:38:42,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:38:42,997 INFO L93 Difference]: Finished difference Result 1470 states and 1993 transitions. [2022-07-21 11:38:42,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 11:38:42,998 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 46 [2022-07-21 11:38:42,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:38:43,005 INFO L225 Difference]: With dead ends: 1470 [2022-07-21 11:38:43,005 INFO L226 Difference]: Without dead ends: 1039 [2022-07-21 11:38:43,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-07-21 11:38:43,008 INFO L413 NwaCegarLoop]: 611 mSDtfsCounter, 1185 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 567 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1261 SdHoareTripleChecker+Valid, 1581 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 567 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-21 11:38:43,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1261 Valid, 1581 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [567 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-21 11:38:43,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2022-07-21 11:38:43,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 846. [2022-07-21 11:38:43,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 651 states have (on average 1.2642089093701996) internal successors, (823), 660 states have internal predecessors, (823), 149 states have call successors, (149), 46 states have call predecessors, (149), 45 states have return successors, (147), 147 states have call predecessors, (147), 147 states have call successors, (147) [2022-07-21 11:38:43,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1119 transitions. [2022-07-21 11:38:43,053 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1119 transitions. Word has length 46 [2022-07-21 11:38:43,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:38:43,054 INFO L495 AbstractCegarLoop]: Abstraction has 846 states and 1119 transitions. [2022-07-21 11:38:43,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-21 11:38:43,054 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1119 transitions. [2022-07-21 11:38:43,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-21 11:38:43,056 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:38:43,056 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:38:43,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 11:38:43,057 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:38:43,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:38:43,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1350486453, now seen corresponding path program 1 times [2022-07-21 11:38:43,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:38:43,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235079263] [2022-07-21 11:38:43,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:38:43,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:38:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:43,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:38:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:43,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:43,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:43,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:43,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-21 11:38:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:43,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 11:38:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:43,192 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-21 11:38:43,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:38:43,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235079263] [2022-07-21 11:38:43,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235079263] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:38:43,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:38:43,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 11:38:43,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307455440] [2022-07-21 11:38:43,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:38:43,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 11:38:43,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:38:43,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 11:38:43,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 11:38:43,194 INFO L87 Difference]: Start difference. First operand 846 states and 1119 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 11:38:44,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:38:44,241 INFO L93 Difference]: Finished difference Result 2038 states and 2791 transitions. [2022-07-21 11:38:44,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 11:38:44,242 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2022-07-21 11:38:44,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:38:44,252 INFO L225 Difference]: With dead ends: 2038 [2022-07-21 11:38:44,252 INFO L226 Difference]: Without dead ends: 2029 [2022-07-21 11:38:44,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-07-21 11:38:44,255 INFO L413 NwaCegarLoop]: 622 mSDtfsCounter, 1091 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 519 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1168 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 519 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-21 11:38:44,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1168 Valid, 1646 Invalid, 1274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [519 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-21 11:38:44,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states. [2022-07-21 11:38:44,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 1653. [2022-07-21 11:38:44,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1653 states, 1274 states have (on average 1.2637362637362637) internal successors, (1610), 1291 states have internal predecessors, (1610), 289 states have call successors, (289), 90 states have call predecessors, (289), 89 states have return successors, (287), 287 states have call predecessors, (287), 287 states have call successors, (287) [2022-07-21 11:38:44,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 2186 transitions. [2022-07-21 11:38:44,311 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 2186 transitions. Word has length 49 [2022-07-21 11:38:44,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:38:44,312 INFO L495 AbstractCegarLoop]: Abstraction has 1653 states and 2186 transitions. [2022-07-21 11:38:44,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 11:38:44,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 2186 transitions. [2022-07-21 11:38:44,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-21 11:38:44,316 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:38:44,316 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 11:38:44,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 11:38:44,317 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:38:44,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:38:44,317 INFO L85 PathProgramCache]: Analyzing trace with hash -403228486, now seen corresponding path program 1 times [2022-07-21 11:38:44,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:38:44,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088590201] [2022-07-21 11:38:44,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:38:44,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:38:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:44,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:38:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:44,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:44,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:44,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:44,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-21 11:38:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:44,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 11:38:44,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:44,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-21 11:38:44,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:44,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 11:38:44,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:44,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:44,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 11:38:44,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:44,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 11:38:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:44,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 11:38:44,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:44,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:44,434 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-21 11:38:44,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:38:44,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088590201] [2022-07-21 11:38:44,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088590201] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:38:44,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:38:44,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 11:38:44,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189720730] [2022-07-21 11:38:44,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:38:44,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 11:38:44,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:38:44,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 11:38:44,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-21 11:38:44,436 INFO L87 Difference]: Start difference. First operand 1653 states and 2186 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-21 11:38:45,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:38:45,730 INFO L93 Difference]: Finished difference Result 6066 states and 8330 transitions. [2022-07-21 11:38:45,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 11:38:45,731 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 110 [2022-07-21 11:38:45,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:38:45,761 INFO L225 Difference]: With dead ends: 6066 [2022-07-21 11:38:45,762 INFO L226 Difference]: Without dead ends: 4427 [2022-07-21 11:38:45,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-21 11:38:45,773 INFO L413 NwaCegarLoop]: 619 mSDtfsCounter, 1570 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 893 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1658 SdHoareTripleChecker+Valid, 1684 SdHoareTripleChecker+Invalid, 1745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 893 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-21 11:38:45,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1658 Valid, 1684 Invalid, 1745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [893 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-21 11:38:45,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4427 states. [2022-07-21 11:38:45,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4427 to 3063. [2022-07-21 11:38:45,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3063 states, 2352 states have (on average 1.2610544217687074) internal successors, (2966), 2385 states have internal predecessors, (2966), 535 states have call successors, (535), 176 states have call predecessors, (535), 175 states have return successors, (533), 533 states have call predecessors, (533), 533 states have call successors, (533) [2022-07-21 11:38:45,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3063 states to 3063 states and 4034 transitions. [2022-07-21 11:38:45,901 INFO L78 Accepts]: Start accepts. Automaton has 3063 states and 4034 transitions. Word has length 110 [2022-07-21 11:38:45,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:38:45,902 INFO L495 AbstractCegarLoop]: Abstraction has 3063 states and 4034 transitions. [2022-07-21 11:38:45,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-21 11:38:45,902 INFO L276 IsEmpty]: Start isEmpty. Operand 3063 states and 4034 transitions. [2022-07-21 11:38:45,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-21 11:38:45,911 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:38:45,911 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 11:38:45,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 11:38:45,911 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:38:45,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:38:45,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1207270975, now seen corresponding path program 1 times [2022-07-21 11:38:45,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:38:45,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628990309] [2022-07-21 11:38:45,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:38:45,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:38:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:46,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:38:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:46,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:46,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:46,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:46,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:46,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-21 11:38:46,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:46,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 11:38:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:46,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 11:38:46,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:46,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:46,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:46,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:46,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 11:38:46,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:46,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:46,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:46,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:46,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:46,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 11:38:46,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:46,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 11:38:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:46,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:46,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-21 11:38:46,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:46,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 11:38:46,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:46,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 11:38:46,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:46,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:46,159 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-07-21 11:38:46,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:38:46,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628990309] [2022-07-21 11:38:46,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628990309] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:38:46,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:38:46,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 11:38:46,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095153584] [2022-07-21 11:38:46,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:38:46,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 11:38:46,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:38:46,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 11:38:46,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-21 11:38:46,161 INFO L87 Difference]: Start difference. First operand 3063 states and 4034 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 11:38:47,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:38:47,175 INFO L93 Difference]: Finished difference Result 7475 states and 10179 transitions. [2022-07-21 11:38:47,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 11:38:47,176 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 153 [2022-07-21 11:38:47,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:38:47,202 INFO L225 Difference]: With dead ends: 7475 [2022-07-21 11:38:47,202 INFO L226 Difference]: Without dead ends: 4430 [2022-07-21 11:38:47,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-07-21 11:38:47,216 INFO L413 NwaCegarLoop]: 552 mSDtfsCounter, 634 mSDsluCounter, 1419 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 529 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 1971 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 529 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 11:38:47,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 1971 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [529 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-21 11:38:47,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4430 states. [2022-07-21 11:38:47,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4430 to 3066. [2022-07-21 11:38:47,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3066 states, 2355 states have (on average 1.259872611464968) internal successors, (2967), 2388 states have internal predecessors, (2967), 535 states have call successors, (535), 176 states have call predecessors, (535), 175 states have return successors, (533), 533 states have call predecessors, (533), 533 states have call successors, (533) [2022-07-21 11:38:47,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3066 states to 3066 states and 4035 transitions. [2022-07-21 11:38:47,327 INFO L78 Accepts]: Start accepts. Automaton has 3066 states and 4035 transitions. Word has length 153 [2022-07-21 11:38:47,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:38:47,327 INFO L495 AbstractCegarLoop]: Abstraction has 3066 states and 4035 transitions. [2022-07-21 11:38:47,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 11:38:47,327 INFO L276 IsEmpty]: Start isEmpty. Operand 3066 states and 4035 transitions. [2022-07-21 11:38:47,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-07-21 11:38:47,332 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:38:47,332 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 11:38:47,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 11:38:47,332 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:38:47,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:38:47,333 INFO L85 PathProgramCache]: Analyzing trace with hash -2012347474, now seen corresponding path program 1 times [2022-07-21 11:38:47,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:38:47,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836024590] [2022-07-21 11:38:47,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:38:47,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:38:47,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:38:47,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:47,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-21 11:38:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 11:38:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 11:38:47,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 11:38:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:47,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:47,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 11:38:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 11:38:47,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 11:38:47,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-21 11:38:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 11:38:47,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:47,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,594 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-21 11:38:47,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:38:47,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836024590] [2022-07-21 11:38:47,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836024590] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:38:47,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:38:47,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 11:38:47,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870302486] [2022-07-21 11:38:47,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:38:47,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 11:38:47,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:38:47,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 11:38:47,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-21 11:38:47,597 INFO L87 Difference]: Start difference. First operand 3066 states and 4035 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 11:38:48,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:38:48,861 INFO L93 Difference]: Finished difference Result 7468 states and 10163 transitions. [2022-07-21 11:38:48,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 11:38:48,861 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 154 [2022-07-21 11:38:48,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:38:48,889 INFO L225 Difference]: With dead ends: 7468 [2022-07-21 11:38:48,889 INFO L226 Difference]: Without dead ends: 4422 [2022-07-21 11:38:48,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-21 11:38:48,902 INFO L413 NwaCegarLoop]: 551 mSDtfsCounter, 458 mSDsluCounter, 2141 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 377 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 2692 SdHoareTripleChecker+Invalid, 1651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 377 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-21 11:38:48,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 2692 Invalid, 1651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [377 Valid, 1274 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-21 11:38:48,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4422 states. [2022-07-21 11:38:49,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4422 to 3070. [2022-07-21 11:38:49,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3070 states, 2357 states have (on average 1.2596521001272805) internal successors, (2969), 2392 states have internal predecessors, (2969), 535 states have call successors, (535), 176 states have call predecessors, (535), 177 states have return successors, (549), 533 states have call predecessors, (549), 533 states have call successors, (549) [2022-07-21 11:38:49,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3070 states to 3070 states and 4053 transitions. [2022-07-21 11:38:49,015 INFO L78 Accepts]: Start accepts. Automaton has 3070 states and 4053 transitions. Word has length 154 [2022-07-21 11:38:49,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:38:49,016 INFO L495 AbstractCegarLoop]: Abstraction has 3070 states and 4053 transitions. [2022-07-21 11:38:49,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 11:38:49,016 INFO L276 IsEmpty]: Start isEmpty. Operand 3070 states and 4053 transitions. [2022-07-21 11:38:49,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-21 11:38:49,020 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:38:49,020 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 11:38:49,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 11:38:49,021 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:38:49,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:38:49,021 INFO L85 PathProgramCache]: Analyzing trace with hash 999453106, now seen corresponding path program 1 times [2022-07-21 11:38:49,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:38:49,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234407584] [2022-07-21 11:38:49,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:38:49,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:38:49,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:49,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:38:49,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:49,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:49,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:49,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-21 11:38:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:49,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 11:38:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:49,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 11:38:49,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:49,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:49,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:49,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:49,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 11:38:49,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:49,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:49,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:49,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:49,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 11:38:49,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:49,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 11:38:49,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:49,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:49,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:49,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 11:38:49,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:49,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:38:49,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:49,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 11:38:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:49,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:49,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:49,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 11:38:49,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:49,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-21 11:38:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:49,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-21 11:38:49,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:49,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:49,299 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-07-21 11:38:49,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:38:49,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234407584] [2022-07-21 11:38:49,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234407584] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:38:49,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494393340] [2022-07-21 11:38:49,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:38:49,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:38:49,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:38:49,301 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-07-21 11:38:49,321 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-07-21 11:38:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:49,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 1240 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-21 11:38:49,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:38:49,724 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-07-21 11:38:49,724 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:38:49,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494393340] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:38:49,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 11:38:49,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2022-07-21 11:38:49,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441816978] [2022-07-21 11:38:49,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:38:49,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 11:38:49,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:38:49,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 11:38:49,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-21 11:38:49,726 INFO L87 Difference]: Start difference. First operand 3070 states and 4053 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-21 11:38:49,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:38:49,814 INFO L93 Difference]: Finished difference Result 6128 states and 8094 transitions. [2022-07-21 11:38:49,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 11:38:49,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 175 [2022-07-21 11:38:49,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:38:49,826 INFO L225 Difference]: With dead ends: 6128 [2022-07-21 11:38:49,826 INFO L226 Difference]: Without dead ends: 3071 [2022-07-21 11:38:49,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-21 11:38:49,835 INFO L413 NwaCegarLoop]: 584 mSDtfsCounter, 3 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1747 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 11:38:49,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1747 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 11:38:49,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3071 states. [2022-07-21 11:38:49,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3071 to 3071. [2022-07-21 11:38:49,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3071 states, 2358 states have (on average 1.2595419847328244) internal successors, (2970), 2393 states have internal predecessors, (2970), 535 states have call successors, (535), 176 states have call predecessors, (535), 177 states have return successors, (549), 533 states have call predecessors, (549), 533 states have call successors, (549) [2022-07-21 11:38:49,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3071 states to 3071 states and 4054 transitions. [2022-07-21 11:38:49,946 INFO L78 Accepts]: Start accepts. Automaton has 3071 states and 4054 transitions. Word has length 175 [2022-07-21 11:38:49,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:38:49,946 INFO L495 AbstractCegarLoop]: Abstraction has 3071 states and 4054 transitions. [2022-07-21 11:38:49,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-21 11:38:49,946 INFO L276 IsEmpty]: Start isEmpty. Operand 3071 states and 4054 transitions. [2022-07-21 11:38:49,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-07-21 11:38:49,950 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:38:49,950 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 11:38:49,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-21 11:38:50,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:38:50,169 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:38:50,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:38:50,170 INFO L85 PathProgramCache]: Analyzing trace with hash -492521926, now seen corresponding path program 1 times [2022-07-21 11:38:50,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:38:50,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344365240] [2022-07-21 11:38:50,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:38:50,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:38:50,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:50,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:38:50,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:50,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:50,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:50,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:50,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:50,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-21 11:38:50,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:50,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 11:38:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:50,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 11:38:50,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:50,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:50,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:50,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 11:38:50,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:50,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:50,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:50,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:50,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 11:38:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:50,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 11:38:50,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:50,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:50,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 11:38:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:50,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:38:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:50,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 11:38:50,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:50,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:50,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 11:38:50,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:50,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-21 11:38:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:50,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-21 11:38:50,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:50,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:50,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:50,432 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-07-21 11:38:50,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:38:50,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344365240] [2022-07-21 11:38:50,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344365240] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:38:50,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033992734] [2022-07-21 11:38:50,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:38:50,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:38:50,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:38:50,434 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 11:38:50,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 11:38:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:50,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 1270 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-21 11:38:50,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:38:50,855 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 42 proven. 3 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-07-21 11:38:50,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 11:38:51,022 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-07-21 11:38:51,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033992734] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 11:38:51,023 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 11:38:51,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 5] total 16 [2022-07-21 11:38:51,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338535391] [2022-07-21 11:38:51,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 11:38:51,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-21 11:38:51,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:38:51,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-21 11:38:51,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-07-21 11:38:51,024 INFO L87 Difference]: Start difference. First operand 3071 states and 4054 transitions. Second operand has 16 states, 16 states have (on average 8.0625) internal successors, (129), 12 states have internal predecessors, (129), 2 states have call successors, (38), 6 states have call predecessors, (38), 5 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2022-07-21 11:38:53,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:38:53,317 INFO L93 Difference]: Finished difference Result 7490 states and 10201 transitions. [2022-07-21 11:38:53,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-21 11:38:53,318 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 8.0625) internal successors, (129), 12 states have internal predecessors, (129), 2 states have call successors, (38), 6 states have call predecessors, (38), 5 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 177 [2022-07-21 11:38:53,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:38:53,340 INFO L225 Difference]: With dead ends: 7490 [2022-07-21 11:38:53,340 INFO L226 Difference]: Without dead ends: 4429 [2022-07-21 11:38:53,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=673, Unknown=0, NotChecked=0, Total=870 [2022-07-21 11:38:53,352 INFO L413 NwaCegarLoop]: 550 mSDtfsCounter, 385 mSDsluCounter, 4456 mSDsCounter, 0 mSdLazyCounter, 2577 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 5006 SdHoareTripleChecker+Invalid, 2863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 2577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-21 11:38:53,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 5006 Invalid, 2863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 2577 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-21 11:38:53,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4429 states. [2022-07-21 11:38:53,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4429 to 3081. [2022-07-21 11:38:53,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3081 states, 2367 states have (on average 1.2589776087874947) internal successors, (2980), 2402 states have internal predecessors, (2980), 535 states have call successors, (535), 177 states have call predecessors, (535), 178 states have return successors, (549), 533 states have call predecessors, (549), 533 states have call successors, (549) [2022-07-21 11:38:53,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 4064 transitions. [2022-07-21 11:38:53,494 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 4064 transitions. Word has length 177 [2022-07-21 11:38:53,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:38:53,494 INFO L495 AbstractCegarLoop]: Abstraction has 3081 states and 4064 transitions. [2022-07-21 11:38:53,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.0625) internal successors, (129), 12 states have internal predecessors, (129), 2 states have call successors, (38), 6 states have call predecessors, (38), 5 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2022-07-21 11:38:53,495 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 4064 transitions. [2022-07-21 11:38:53,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-07-21 11:38:53,500 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:38:53,500 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 11:38:53,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 11:38:53,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-07-21 11:38:53,716 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:38:53,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:38:53,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1819792238, now seen corresponding path program 2 times [2022-07-21 11:38:53,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:38:53,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872112677] [2022-07-21 11:38:53,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:38:53,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:38:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:53,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:38:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:53,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:53,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:53,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-21 11:38:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:53,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 11:38:53,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:53,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 11:38:53,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:53,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:53,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:53,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:53,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:53,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 11:38:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:53,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:53,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:53,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:54,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 11:38:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:54,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 11:38:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:54,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:54,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 11:38:54,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:54,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:38:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:54,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 11:38:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:54,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:54,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:54,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 11:38:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:54,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-21 11:38:54,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:54,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-21 11:38:54,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:54,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:54,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:54,046 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-21 11:38:54,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:38:54,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872112677] [2022-07-21 11:38:54,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872112677] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:38:54,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144393670] [2022-07-21 11:38:54,047 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 11:38:54,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:38:54,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:38:54,049 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 11:38:54,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-21 11:38:54,497 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 11:38:54,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 11:38:54,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 1330 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-21 11:38:54,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:38:54,579 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 55 proven. 3 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-07-21 11:38:54,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 11:38:54,829 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-21 11:38:54,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144393670] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 11:38:54,829 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 11:38:54,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 17 [2022-07-21 11:38:54,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62754040] [2022-07-21 11:38:54,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 11:38:54,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-21 11:38:54,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:38:54,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-21 11:38:54,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-07-21 11:38:54,831 INFO L87 Difference]: Start difference. First operand 3081 states and 4064 transitions. Second operand has 17 states, 17 states have (on average 7.764705882352941) internal successors, (132), 13 states have internal predecessors, (132), 2 states have call successors, (39), 6 states have call predecessors, (39), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2022-07-21 11:38:56,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:38:56,701 INFO L93 Difference]: Finished difference Result 7497 states and 10207 transitions. [2022-07-21 11:38:56,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-21 11:38:56,701 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 7.764705882352941) internal successors, (132), 13 states have internal predecessors, (132), 2 states have call successors, (39), 6 states have call predecessors, (39), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 181 [2022-07-21 11:38:56,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:38:56,720 INFO L225 Difference]: With dead ends: 7497 [2022-07-21 11:38:56,720 INFO L226 Difference]: Without dead ends: 4433 [2022-07-21 11:38:56,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 395 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=259, Invalid=733, Unknown=0, NotChecked=0, Total=992 [2022-07-21 11:38:56,731 INFO L413 NwaCegarLoop]: 552 mSDtfsCounter, 654 mSDsluCounter, 2678 mSDsCounter, 0 mSdLazyCounter, 1529 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 3230 SdHoareTripleChecker+Invalid, 2077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-21 11:38:56,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 3230 Invalid, 2077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1529 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-21 11:38:56,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4433 states. [2022-07-21 11:38:56,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4433 to 3085. [2022-07-21 11:38:56,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3085 states, 2371 states have (on average 1.258540700126529) internal successors, (2984), 2406 states have internal predecessors, (2984), 535 states have call successors, (535), 177 states have call predecessors, (535), 178 states have return successors, (549), 533 states have call predecessors, (549), 533 states have call successors, (549) [2022-07-21 11:38:56,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3085 states to 3085 states and 4068 transitions. [2022-07-21 11:38:56,845 INFO L78 Accepts]: Start accepts. Automaton has 3085 states and 4068 transitions. Word has length 181 [2022-07-21 11:38:56,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:38:56,845 INFO L495 AbstractCegarLoop]: Abstraction has 3085 states and 4068 transitions. [2022-07-21 11:38:56,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.764705882352941) internal successors, (132), 13 states have internal predecessors, (132), 2 states have call successors, (39), 6 states have call predecessors, (39), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2022-07-21 11:38:56,846 INFO L276 IsEmpty]: Start isEmpty. Operand 3085 states and 4068 transitions. [2022-07-21 11:38:56,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-07-21 11:38:56,851 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:38:56,851 INFO L195 NwaCegarLoop]: trace histogram [10, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 11:38:56,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-21 11:38:57,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:38:57,060 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:38:57,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:38:57,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1633431598, now seen corresponding path program 3 times [2022-07-21 11:38:57,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:38:57,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972056425] [2022-07-21 11:38:57,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:38:57,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:38:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:57,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:38:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:57,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:57,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:57,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-21 11:38:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:57,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 11:38:57,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:57,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 11:38:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:57,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:57,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:57,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:57,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 11:38:57,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:57,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:57,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:57,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:57,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-21 11:38:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:57,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 11:38:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:57,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:57,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:57,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 11:38:57,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:57,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:38:57,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:57,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 11:38:57,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:57,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:57,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 11:38:57,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:57,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-21 11:38:57,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:57,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-21 11:38:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:57,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:57,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:57,415 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-21 11:38:57,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:38:57,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972056425] [2022-07-21 11:38:57,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972056425] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:38:57,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513992786] [2022-07-21 11:38:57,416 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 11:38:57,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:38:57,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:38:57,417 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 11:38:57,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-21 11:38:59,198 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-07-21 11:38:59,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 11:38:59,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 1390 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-21 11:38:59,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:38:59,407 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 75 proven. 21 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-07-21 11:38:59,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 11:38:59,712 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-21 11:38:59,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513992786] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 11:38:59,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 11:38:59,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 29 [2022-07-21 11:38:59,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103839241] [2022-07-21 11:38:59,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 11:38:59,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-21 11:38:59,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:38:59,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-21 11:38:59,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=652, Unknown=0, NotChecked=0, Total=812 [2022-07-21 11:38:59,716 INFO L87 Difference]: Start difference. First operand 3085 states and 4068 transitions. Second operand has 29 states, 29 states have (on average 4.9655172413793105) internal successors, (144), 25 states have internal predecessors, (144), 2 states have call successors, (39), 6 states have call predecessors, (39), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2022-07-21 11:39:02,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:39:02,846 INFO L93 Difference]: Finished difference Result 7507 states and 10218 transitions. [2022-07-21 11:39:02,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-21 11:39:02,846 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 4.9655172413793105) internal successors, (144), 25 states have internal predecessors, (144), 2 states have call successors, (39), 6 states have call predecessors, (39), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 185 [2022-07-21 11:39:02,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:39:02,863 INFO L225 Difference]: With dead ends: 7507 [2022-07-21 11:39:02,863 INFO L226 Difference]: Without dead ends: 4443 [2022-07-21 11:39:02,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 395 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=467, Invalid=1789, Unknown=0, NotChecked=0, Total=2256 [2022-07-21 11:39:02,874 INFO L413 NwaCegarLoop]: 555 mSDtfsCounter, 489 mSDsluCounter, 5441 mSDsCounter, 0 mSdLazyCounter, 3250 mSolverCounterSat, 339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 5996 SdHoareTripleChecker+Invalid, 3589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 3250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-21 11:39:02,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 5996 Invalid, 3589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [339 Valid, 3250 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-21 11:39:02,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4443 states. [2022-07-21 11:39:02,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4443 to 3089. [2022-07-21 11:39:02,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3089 states, 2375 states have (on average 1.2585263157894737) internal successors, (2989), 2410 states have internal predecessors, (2989), 535 states have call successors, (535), 177 states have call predecessors, (535), 178 states have return successors, (549), 533 states have call predecessors, (549), 533 states have call successors, (549) [2022-07-21 11:39:02,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3089 states to 3089 states and 4073 transitions. [2022-07-21 11:39:02,988 INFO L78 Accepts]: Start accepts. Automaton has 3089 states and 4073 transitions. Word has length 185 [2022-07-21 11:39:02,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:39:02,988 INFO L495 AbstractCegarLoop]: Abstraction has 3089 states and 4073 transitions. [2022-07-21 11:39:02,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.9655172413793105) internal successors, (144), 25 states have internal predecessors, (144), 2 states have call successors, (39), 6 states have call predecessors, (39), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2022-07-21 11:39:02,989 INFO L276 IsEmpty]: Start isEmpty. Operand 3089 states and 4073 transitions. [2022-07-21 11:39:02,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-07-21 11:39:02,993 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:39:02,993 INFO L195 NwaCegarLoop]: trace histogram [12, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 11:39:03,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-21 11:39:03,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:39:03,212 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:39:03,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:39:03,213 INFO L85 PathProgramCache]: Analyzing trace with hash 45303154, now seen corresponding path program 4 times [2022-07-21 11:39:03,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:39:03,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331705974] [2022-07-21 11:39:03,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:39:03,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:39:03,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 11:39:03,432 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 11:39:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 11:39:03,584 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 11:39:03,584 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 11:39:03,585 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 11:39:03,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 11:39:03,589 INFO L356 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:39:03,592 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 11:39:03,620 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 11:39:03,621 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 11:39:03,621 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 11:39:03,621 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 11:39:03,622 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 11:39:03,622 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 11:39:03,622 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 11:39:03,622 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 11:39:03,623 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 11:39:03,623 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 11:39:03,623 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 11:39:03,623 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 11:39:03,623 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 11:39:03,623 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 11:39:03,624 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 11:39:03,624 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 11:39:03,624 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 11:39:03,624 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 11:39:03,624 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 11:39:03,624 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 11:39:03,624 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 11:39:03,625 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 11:39:03,625 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 11:39:03,625 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 11:39:03,626 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 11:39:03,626 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 11:39:03,626 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 11:39:03,626 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 11:39:03,626 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 11:39:03,626 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 11:39:03,627 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 11:39:03,627 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 11:39:03,627 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 11:39:03,627 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 11:39:03,627 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 11:39:03,627 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 11:39:03,627 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 11:39:03,628 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 11:39:03,628 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 11:39:03,628 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 11:39:03,628 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 11:39:03,628 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 11:39:03,628 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 11:39:03,628 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 11:39:03,629 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 11:39:03,629 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 11:39:03,629 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 11:39:03,629 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 11:39:03,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 11:39:03 BoogieIcfgContainer [2022-07-21 11:39:03,717 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 11:39:03,717 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 11:39:03,717 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 11:39:03,717 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 11:39:03,718 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:38:40" (3/4) ... [2022-07-21 11:39:03,720 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-21 11:39:03,720 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 11:39:03,720 INFO L158 Benchmark]: Toolchain (without parser) took 26103.44ms. Allocated memory was 52.4MB in the beginning and 566.2MB in the end (delta: 513.8MB). Free memory was 35.7MB in the beginning and 354.6MB in the end (delta: -318.9MB). Peak memory consumption was 193.9MB. Max. memory is 16.1GB. [2022-07-21 11:39:03,721 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 52.4MB. Free memory was 34.4MB in the beginning and 34.4MB in the end (delta: 37.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 11:39:03,721 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1213.30ms. Allocated memory was 52.4MB in the beginning and 86.0MB in the end (delta: 33.6MB). Free memory was 35.6MB in the beginning and 48.6MB in the end (delta: -13.0MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. [2022-07-21 11:39:03,721 INFO L158 Benchmark]: Boogie Procedure Inliner took 129.53ms. Allocated memory is still 86.0MB. Free memory was 48.6MB in the beginning and 37.7MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-21 11:39:03,721 INFO L158 Benchmark]: Boogie Preprocessor took 131.68ms. Allocated memory is still 86.0MB. Free memory was 37.7MB in the beginning and 42.7MB in the end (delta: -5.0MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2022-07-21 11:39:03,721 INFO L158 Benchmark]: RCFGBuilder took 1301.84ms. Allocated memory was 86.0MB in the beginning and 109.1MB in the end (delta: 23.1MB). Free memory was 42.7MB in the beginning and 51.9MB in the end (delta: -9.1MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. [2022-07-21 11:39:03,722 INFO L158 Benchmark]: TraceAbstraction took 23319.24ms. Allocated memory was 109.1MB in the beginning and 566.2MB in the end (delta: 457.2MB). Free memory was 51.9MB in the beginning and 354.6MB in the end (delta: -302.7MB). Peak memory consumption was 154.5MB. Max. memory is 16.1GB. [2022-07-21 11:39:03,722 INFO L158 Benchmark]: Witness Printer took 2.86ms. Allocated memory is still 566.2MB. Free memory is still 354.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 11:39:03,723 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.18ms. Allocated memory is still 52.4MB. Free memory was 34.4MB in the beginning and 34.4MB in the end (delta: 37.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1213.30ms. Allocated memory was 52.4MB in the beginning and 86.0MB in the end (delta: 33.6MB). Free memory was 35.6MB in the beginning and 48.6MB in the end (delta: -13.0MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 129.53ms. Allocated memory is still 86.0MB. Free memory was 48.6MB in the beginning and 37.7MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 131.68ms. Allocated memory is still 86.0MB. Free memory was 37.7MB in the beginning and 42.7MB in the end (delta: -5.0MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1301.84ms. Allocated memory was 86.0MB in the beginning and 109.1MB in the end (delta: 23.1MB). Free memory was 42.7MB in the beginning and 51.9MB in the end (delta: -9.1MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. * TraceAbstraction took 23319.24ms. Allocated memory was 109.1MB in the beginning and 566.2MB in the end (delta: 457.2MB). Free memory was 51.9MB in the beginning and 354.6MB in the end (delta: -302.7MB). Peak memory consumption was 154.5MB. Max. memory is 16.1GB. * Witness Printer took 2.86ms. Allocated memory is still 566.2MB. Free memory is still 354.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - 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 * 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: 4236]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of large string literal at line 4030. Possible FailurePath: [L3355] int LDV_IN_INTERRUPT = 1; [L3356] struct block_device *virtblk_fops_group0 ; [L3357] int ldv_state_variable_2 ; [L3358] int ref_cnt ; [L3359] int ldv_state_variable_1 ; [L3360] struct virtio_device *virtio_blk_group0 ; [L3361] int ldv_state_variable_0 ; [L3492] static int major ; [L3493] static int index ; [L3818-L3819] static struct block_device_operations const virtblk_fops = {0, 0, & virtblk_ioctl, 0, 0, 0, 0, 0, 0, & virtblk_getgeo, 0, & __this_module}; [L4018-L4019] static struct virtio_device_id const id_table[2U] = { {2U, 4294967295U}, {0U, 0U}}; [L4020-L4023] static unsigned int features[9U] = { 0U, 2U, 1U, 4U, 5U, 6U, 7U, 9U, 10U}; [L4024-L4025] static struct virtio_driver virtio_blk = {{"virtio_blk", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0}, (struct virtio_device_id const *)(& id_table), (unsigned int const *)(& features), 9U, & virtblk_probe, & virtblk_remove, 0}; [L4047] struct virtio_device_id const __mod_virtio_device_table ; [L4048] int ldv_retval_0 ; [L4049] int ldv_retval_1 ; [L4283] int ldv_blk_rq = 0; VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4072] unsigned long ldvarg1 ; [L4073] fmode_t ldvarg3 ; [L4074] struct hd_geometry *ldvarg0 ; [L4075] void *tmp ; [L4076] unsigned int ldvarg2 ; [L4077] int tmp___0 ; [L4078] int tmp___1 ; [L4079] int tmp___2 ; [L4080] int tmp___3 ; VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg1={2016:0}, ldvarg3={2015:0}, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4082] CALL, EXPR ldv_init_zalloc(16UL) VAL [\old(size)=16, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3290] void *p ; [L3291] void *tmp ; [L3293] EXPR, FCALL calloc(1UL, size) VAL [\old(size)=16, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, calloc(1UL, size)={-18446744073709551617:0}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, major=0, ref_cnt=0, size=16, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3293] tmp = calloc(1UL, size) [L3294] p = tmp VAL [\old(size)=16, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, calloc(1UL, size)={-18446744073709551617:0}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, major=0, p={-18446744073709551617:0}, ref_cnt=0, size=16, tmp={-18446744073709551617:0}, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3295] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(cond)=1, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3249] COND FALSE !(!cond) VAL [\old(cond)=1, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, cond=1, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3295] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(size)=16, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, calloc(1UL, size)={-18446744073709551617:0}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, major=0, p={-18446744073709551617:0}, ref_cnt=0, size=16, tmp={-18446744073709551617:0}, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3296] return (p); VAL [\old(size)=16, \result={-18446744073709551617:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, calloc(1UL, size)={-18446744073709551617:0}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, major=0, p={-18446744073709551617:0}, ref_cnt=0, size=16, tmp={-18446744073709551617:0}, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4082] RET, EXPR ldv_init_zalloc(16UL) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_init_zalloc(16UL)={-18446744073709551617:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg1={2016:0}, ldvarg3={2015:0}, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4082] tmp = ldv_init_zalloc(16UL) [L4083] ldvarg0 = (struct hd_geometry *)tmp [L4084] FCALL ldv_initialize() [L4085] CALL ldv_memset((void *)(& ldvarg1), 0, 8UL) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3301] void *tmp ; [L3303] EXPR, FCALL memset(s, c, n) [L3303] tmp = memset(s, c, n) [L3304] return (tmp); VAL [\old(c)=0, \old(n)=8, \result={2016:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, c=0, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, major=0, n=8, ref_cnt=0, s={2016:0}, s={2016:0}, tmp={2016:0}, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4085] RET ldv_memset((void *)(& ldvarg1), 0, 8UL) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_memset((void *)(& ldvarg1), 0, 8UL)={2016:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={-18446744073709551617:0}, ldvarg1={2016:0}, ldvarg3={2015:0}, major=0, ref_cnt=0, tmp={-18446744073709551617:0}, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4086] CALL ldv_memset((void *)(& ldvarg3), 0, 4UL) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3301] void *tmp ; [L3303] EXPR, FCALL memset(s, c, n) [L3303] tmp = memset(s, c, n) [L3304] return (tmp); VAL [\old(c)=0, \old(n)=4, \result={2015:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, c=0, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, major=0, n=4, ref_cnt=0, s={2015:0}, s={2015:0}, tmp={2015:0}, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4086] RET ldv_memset((void *)(& ldvarg3), 0, 4UL) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_memset((void *)(& ldvarg3), 0, 4UL)={2015:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={-18446744073709551617:0}, ldvarg1={2016:0}, ldvarg3={2015:0}, major=0, ref_cnt=0, tmp={-18446744073709551617:0}, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4087] ldvarg2 = __VERIFIER_nondet_ulong () [L4088] ldv_state_variable_1 = 0 [L4089] ref_cnt = 0 [L4090] ldv_state_variable_0 = 1 [L4091] ldv_state_variable_2 = 0 VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={-18446744073709551617:0}, ldvarg1={2016:0}, ldvarg2=1447184708, ldvarg3={2015:0}, major=0, ref_cnt=0, tmp={-18446744073709551617:0}, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4093] tmp___0 = __VERIFIER_nondet_int() [L4095] case 0: [L4125] case 1: VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={-18446744073709551617:0}, ldvarg1={2016:0}, ldvarg2=1447184708, ldvarg3={2015:0}, major=0, ref_cnt=0, tmp={-18446744073709551617:0}, tmp___0=1, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4126] COND TRUE ldv_state_variable_0 != 0 [L4127] tmp___2 = __VERIFIER_nondet_int() [L4129] case 0: [L4137] case 1: VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={-18446744073709551617:0}, ldvarg1={2016:0}, ldvarg2=1447184708, ldvarg3={2015:0}, major=0, ref_cnt=0, tmp={-18446744073709551617:0}, tmp___0=1, tmp___2=1, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4138] COND TRUE ldv_state_variable_0 == 1 [L4139] CALL, EXPR init() [L4028] int tmp ; [L4030] CALL, EXPR register_blkdev(0U, "virtblk") [L4472] return __VERIFIER_nondet_int(); [L4030] RET, EXPR register_blkdev(0U, "virtblk") [L4030] major = register_blkdev(0U, "virtblk") [L4031] COND FALSE !(major < 0) [L4035] CALL, EXPR register_virtio_driver(& virtio_blk) [L4476] return __VERIFIER_nondet_int(); [L4035] RET, EXPR register_virtio_driver(& virtio_blk) [L4035] tmp = register_virtio_driver(& virtio_blk) [L4036] return (tmp); VAL [\result=0, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, major=0, ref_cnt=0, tmp=0, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4139] RET, EXPR init() [L4139] ldv_retval_1 = init() [L4140] COND TRUE ldv_retval_1 == 0 [L4141] ldv_state_variable_0 = 3 [L4142] ldv_state_variable_2 = 1 [L4143] CALL ldv_initialize_block_device_operations_2() [L4063] void *tmp ; VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=0, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4065] CALL, EXPR ldv_init_zalloc(464UL) VAL [\old(size)=464, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=0, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3290] void *p ; [L3291] void *tmp ; [L3293] EXPR, FCALL calloc(1UL, size) VAL [\old(size)=464, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, calloc(1UL, size)={-36893488147419103233:0}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=0, ldv_state_variable_2=1, major=0, ref_cnt=0, size=464, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3293] tmp = calloc(1UL, size) [L3294] p = tmp VAL [\old(size)=464, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, calloc(1UL, size)={-36893488147419103233:0}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=0, ldv_state_variable_2=1, major=0, p={-36893488147419103233:0}, ref_cnt=0, size=464, tmp={-36893488147419103233:0}, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3295] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(cond)=1, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=0, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3249] COND FALSE !(!cond) VAL [\old(cond)=1, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, cond=1, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=0, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3295] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(size)=464, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, calloc(1UL, size)={-36893488147419103233:0}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=0, ldv_state_variable_2=1, major=0, p={-36893488147419103233:0}, ref_cnt=0, size=464, tmp={-36893488147419103233:0}, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3296] return (p); VAL [\old(size)=464, \result={-36893488147419103233:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, calloc(1UL, size)={-36893488147419103233:0}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=0, ldv_state_variable_2=1, major=0, p={-36893488147419103233:0}, ref_cnt=0, size=464, tmp={-36893488147419103233:0}, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4065] RET, EXPR ldv_init_zalloc(464UL) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_init_zalloc(464UL)={-36893488147419103233:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=0, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4065] tmp = ldv_init_zalloc(464UL) [L4066] virtblk_fops_group0 = (struct block_device *)tmp VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=0, ldv_state_variable_2=1, major=0, ref_cnt=0, tmp={-36893488147419103233:0}, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4143] RET ldv_initialize_block_device_operations_2() [L4144] ldv_state_variable_1 = 1 [L4145] CALL ldv_initialize_virtio_driver_1() [L4054] void *tmp ; VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4056] CALL, EXPR ldv_init_zalloc(1048UL) VAL [\old(size)=1048, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3290] void *p ; [L3291] void *tmp ; [L3293] EXPR, FCALL calloc(1UL, size) VAL [\old(size)=1048, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, calloc(1UL, size)={-55340232221128654849:0}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, size=1048, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3293] tmp = calloc(1UL, size) [L3294] p = tmp VAL [\old(size)=1048, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, calloc(1UL, size)={-55340232221128654849:0}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, p={-55340232221128654849:0}, ref_cnt=0, size=1048, tmp={-55340232221128654849:0}, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3295] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(cond)=1, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3249] COND FALSE !(!cond) VAL [\old(cond)=1, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, cond=1, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3295] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(size)=1048, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, calloc(1UL, size)={-55340232221128654849:0}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, p={-55340232221128654849:0}, ref_cnt=0, size=1048, tmp={-55340232221128654849:0}, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3296] return (p); VAL [\old(size)=1048, \result={-55340232221128654849:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, calloc(1UL, size)={-55340232221128654849:0}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, p={-55340232221128654849:0}, ref_cnt=0, size=1048, tmp={-55340232221128654849:0}, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4056] RET, EXPR ldv_init_zalloc(1048UL) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_init_zalloc(1048UL)={-55340232221128654849:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4056] tmp = ldv_init_zalloc(1048UL) [L4057] virtio_blk_group0 = (struct virtio_device *)tmp VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, tmp={-55340232221128654849:0}, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4145] RET ldv_initialize_virtio_driver_1() [L4148] COND FALSE !(ldv_retval_1 != 0) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldvarg0={-18446744073709551617:0}, ldvarg1={2016:0}, ldvarg2=1447184708, ldvarg3={2015:0}, major=0, ref_cnt=0, tmp={-18446744073709551617:0}, tmp___0=1, tmp___2=1, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4093] tmp___0 = __VERIFIER_nondet_int() [L4095] case 0: [L4125] case 1: [L4163] case 2: VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldvarg0={-18446744073709551617:0}, ldvarg1={2016:0}, ldvarg2=1447184708, ldvarg3={2015:0}, major=0, ref_cnt=0, tmp={-18446744073709551617:0}, tmp___0=2, tmp___2=1, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4164] COND TRUE ldv_state_variable_2 != 0 [L4165] tmp___3 = __VERIFIER_nondet_int() [L4167] case 0: VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldvarg0={-18446744073709551617:0}, ldvarg1={2016:0}, ldvarg2=1447184708, ldvarg3={2015:0}, major=0, ref_cnt=0, tmp={-18446744073709551617:0}, tmp___0=2, tmp___2=1, tmp___3=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4168] COND TRUE ldv_state_variable_2 == 1 [L4169] EXPR \read(ldvarg3) [L4169] EXPR \read(ldvarg1) [L4169] CALL virtblk_ioctl(virtblk_fops_group0, ldvarg3, ldvarg2, ldvarg1) [L3756] struct gendisk *disk ; [L3757] struct virtio_blk *vblk ; [L3758] void *usr_data ; [L3759] char id_str[20U] ; [L3760] int err ; [L3761] int tmp ; [L3762] bool tmp___0 ; [L3763] int tmp___1 ; [L3764] int tmp___2 ; [L3766] EXPR bdev->bd_disk [L3766] disk = bdev->bd_disk [L3767] EXPR disk->private_data [L3767] vblk = (struct virtio_blk *)disk->private_data [L3768] COND TRUE cmd == 1447184708U [L3769] usr_data = (void *)data [L3770] CALL, EXPR virtblk_get_id(disk, (char *)(& id_str)) [L3723] struct virtio_blk *vblk ; [L3724] struct request *req ; [L3725] struct bio *bio ; [L3726] long tmp ; [L3727] long tmp___0 ; [L3728] long tmp___1 ; [L3729] long tmp___2 ; [L3730] int tmp___3 ; [L3732] EXPR disk->private_data [L3732] vblk = (struct virtio_blk *)disk->private_data [L3733] EXPR vblk->disk [L3733] EXPR (vblk->disk)->queue [L3733] CALL, EXPR bio_map_kern((vblk->disk)->queue, (void *)id_str, 20U, 208U) [L4381] CALL, EXPR ldv_malloc(sizeof(struct bio)) VAL [\old(size)=112, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L3254] void *p ; [L3255] void *tmp ; [L3256] int tmp___0 ; [L3258] tmp___0 = __VERIFIER_nondet_int() [L3259] COND TRUE tmp___0 != 0 [L3260] return ((void *)0); VAL [\old(size)=112, \result={0:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, size=112, tmp___0=1, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4381] RET, EXPR ldv_malloc(sizeof(struct bio)) VAL [\old(arg2)=20, \old(arg3)=208, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, arg0={4294967298:4294967303}, arg0={4294967298:4294967303}, arg1={2014:0}, arg1={2014:0}, arg2=20, arg3=208, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct bio))={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4381] return ldv_malloc(sizeof(struct bio)); [L3733] RET, EXPR bio_map_kern((vblk->disk)->queue, (void *)id_str, 20U, 208U) [L3733] bio = bio_map_kern((vblk->disk)->queue, (void *)id_str, 20U, 208U) [L3734] CALL, EXPR IS_ERR((void const *)bio) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ptr={0:0}, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4216] bool tmp ; VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ptr={0:0}, ptr={0:0}, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4218] CALL, EXPR ldv_is_err(ptr) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ptr={0:0}, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4242] return ((unsigned long )ptr > 2012UL); VAL [\result=0, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ptr={0:0}, ptr={0:0}, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4218] RET, EXPR ldv_is_err(ptr) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_is_err(ptr)=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ptr={0:0}, ptr={0:0}, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4218] tmp = ldv_is_err(ptr) [L4219] return ((long )tmp); VAL [\result=0, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ptr={0:0}, ptr={0:0}, ref_cnt=0, tmp=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L3734] RET, EXPR IS_ERR((void const *)bio) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, bio={0:0}, disk={4294967302:0}, disk={4294967302:0}, features={13:0}, id_str={2014:0}, id_str={2014:0}, id_table={12:0}, index=0, IS_ERR((void const *)bio)=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, vblk={4294967300:-2}, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L3734] tmp___0 = IS_ERR((void const *)bio) [L3735] COND FALSE !(tmp___0 != 0L) [L3740] EXPR vblk->disk [L3740] EXPR (vblk->disk)->queue [L3740] CALL, EXPR ldv_blk_make_request_5((vblk->disk)->queue, bio, 208U) [L4225] struct request *tmp ; [L4227] CALL, EXPR ldv_blk_make_request(ldv_func_arg3) [L4309] struct request *res ; [L4310] long tmp___0 ; VAL [\old(mask)=208, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, mask=208, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4312] COND FALSE !(ldv_blk_rq != 0) VAL [\old(mask)=208, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, mask=208, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4316] CALL, EXPR ldv_malloc(sizeof(struct request)) VAL [\old(size)=322, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L3254] void *p ; [L3255] void *tmp ; [L3256] int tmp___0 ; [L3258] tmp___0 = __VERIFIER_nondet_int() [L3259] COND FALSE !(tmp___0 != 0) [L3262] tmp = malloc(size) [L3263] p = tmp VAL [\old(size)=322, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, p={2012:0}, ref_cnt=0, size=322, tmp={2012:0}, tmp___0=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L3264] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(cond)=1, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L3249] COND FALSE !(!cond) VAL [\old(cond)=1, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, cond=1, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L3264] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(size)=322, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, p={2012:0}, ref_cnt=0, size=322, tmp={2012:0}, tmp___0=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L3265] CALL, EXPR IS_ERR(p) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ptr={2012:0}, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4216] bool tmp ; VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ptr={2012:0}, ptr={2012:0}, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4218] CALL, EXPR ldv_is_err(ptr) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ptr={2012:0}, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4242] return ((unsigned long )ptr > 2012UL); VAL [\result=0, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ptr={2012:0}, ptr={2012:0}, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4218] RET, EXPR ldv_is_err(ptr) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_is_err(ptr)=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ptr={2012:0}, ptr={2012:0}, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4218] tmp = ldv_is_err(ptr) [L4219] return ((long )tmp); VAL [\result=0, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ptr={2012:0}, ptr={2012:0}, ref_cnt=0, tmp=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L3265] RET, EXPR IS_ERR(p) VAL [\old(size)=322, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, IS_ERR(p)=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, p={2012:0}, ref_cnt=0, size=322, tmp={2012:0}, tmp___0=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L3265] CALL assume_abort_if_not(IS_ERR(p) == 0) VAL [\old(cond)=1, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L3249] COND FALSE !(!cond) VAL [\old(cond)=1, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, cond=1, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L3265] RET assume_abort_if_not(IS_ERR(p) == 0) VAL [\old(size)=322, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, IS_ERR(p)=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, p={2012:0}, ref_cnt=0, size=322, tmp={2012:0}, tmp___0=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L3266] return (p); VAL [\old(size)=322, \result={2012:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, p={2012:0}, ref_cnt=0, size=322, tmp={2012:0}, tmp___0=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4316] RET, EXPR ldv_malloc(sizeof(struct request)) VAL [\old(mask)=208, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct request))={2012: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, mask=208, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4316] res = ldv_malloc(sizeof(struct request)) [L4317] COND FALSE !((unsigned long )res == (unsigned long )((struct request *)0)) VAL [\old(mask)=208, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, mask=208, ref_cnt=0, res={2012:0}, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4321] CALL, EXPR IS_ERR___0((void const *)res) [L4277] long tmp ; VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ptr={2012:0}, ptr={2012:0}, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4279] CALL, EXPR ldv__builtin_expect((unsigned long )ptr > 0xfffffffffffff000UL, 0L) VAL [\old(c)=0, \old(exp)=0, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L3333] return (exp); VAL [\old(c)=0, \old(exp)=0, \result=0, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, c=0, exp=0, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4279] RET, EXPR ldv__builtin_expect((unsigned long )ptr > 0xfffffffffffff000UL, 0L) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv__builtin_expect((unsigned long )ptr > 0xfffffffffffff000UL, 0L)=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={2012:0}, ptr={2012:0}, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4279] tmp = ldv__builtin_expect((unsigned long )ptr > 0xfffffffffffff000UL, 0L) [L4280] return (tmp); VAL [\result=0, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ptr={2012:0}, ptr={2012:0}, ref_cnt=0, tmp=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4321] RET, EXPR IS_ERR___0((void const *)res) [L4321] tmp___0 = IS_ERR___0((void const *)res) [L4322] COND TRUE tmp___0 == 0L [L4323] ldv_blk_rq = 1 VAL [\old(mask)=208, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=1, 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, mask=208, ref_cnt=0, res={2012:0}, tmp___0=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4326] return (res); VAL [\old(mask)=208, \result={2012:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=1, 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, mask=208, ref_cnt=0, res={2012:0}, tmp___0=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4227] RET, EXPR ldv_blk_make_request(ldv_func_arg3) [L4227] tmp = ldv_blk_make_request(ldv_func_arg3) [L4228] return (tmp); VAL [\old(ldv_func_arg3)=208, \result={2012:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=1, ldv_func_arg1={4294967298:4294967303}, ldv_func_arg1={4294967298:4294967303}, ldv_func_arg2={0:0}, ldv_func_arg2={0:0}, ldv_func_arg3=208, 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={2012:0}, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L3740] RET, EXPR ldv_blk_make_request_5((vblk->disk)->queue, bio, 208U) [L3740] req = ldv_blk_make_request_5((vblk->disk)->queue, bio, 208U) [L3741] CALL, EXPR IS_ERR((void const *)req) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=1, 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={2012:0}, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4216] bool tmp ; VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=1, 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={2012:0}, ptr={2012:0}, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4218] CALL, EXPR ldv_is_err(ptr) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=1, 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={2012:0}, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4242] return ((unsigned long )ptr > 2012UL); VAL [\result=0, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=1, 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={2012:0}, ptr={2012:0}, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4218] RET, EXPR ldv_is_err(ptr) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=1, LDV_IN_INTERRUPT=1, ldv_is_err(ptr)=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ptr={2012:0}, ptr={2012:0}, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4218] tmp = ldv_is_err(ptr) [L4219] return ((long )tmp); VAL [\result=0, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=1, 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={2012:0}, ptr={2012:0}, ref_cnt=0, tmp=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L3741] RET, EXPR IS_ERR((void const *)req) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, bio={0:0}, disk={4294967302:0}, disk={4294967302:0}, features={13:0}, id_str={2014:0}, id_str={2014:0}, id_table={12:0}, index=0, IS_ERR((void const *)req)=0, ldv_blk_rq=1, 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, req={2012:0}, tmp___0=0, vblk={4294967300:-2}, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L3741] tmp___2 = IS_ERR((void const *)req) [L3742] COND FALSE !(tmp___2 != 0L) [L3748] req->cmd_type = 7 [L3749] EXPR vblk->disk [L3749] EXPR (vblk->disk)->queue [L3749] EXPR vblk->disk [L3749] CALL, EXPR blk_execute_rq((vblk->disk)->queue, vblk->disk, req, 0) [L4391] return __VERIFIER_nondet_int(); [L3749] RET, EXPR blk_execute_rq((vblk->disk)->queue, vblk->disk, req, 0) [L3749] tmp___3 = blk_execute_rq((vblk->disk)->queue, vblk->disk, req, 0) [L3750] return (tmp___3); VAL [\result=1, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, bio={0:0}, disk={4294967302:0}, disk={4294967302:0}, features={13:0}, id_str={2014:0}, id_str={2014:0}, id_table={12:0}, index=0, ldv_blk_rq=1, 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, req={2012:0}, tmp___0=0, tmp___2=0, tmp___3=1, vblk={4294967300:-2}, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L3770] RET, EXPR virtblk_get_id(disk, (char *)(& id_str)) [L3770] err = virtblk_get_id(disk, (char *)(& id_str)) [L3771] COND FALSE !(err == 0) VAL [\old(cmd)=1447184708, \old(data)=0, \old(mode)=0, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, bdev={-36893488147419103233:0}, bdev={-36893488147419103233:0}, cmd=1447184708, data=0, disk={4294967302:0}, err=1, features={13:0}, id_str={2014:0}, id_table={12:0}, index=0, ldv_blk_rq=1, 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, mode=0, ref_cnt=0, usr_data={0:0}, vblk={4294967300:-2}, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L3779] return (err); [L3779] return (err); VAL [\old(cmd)=1447184708, \old(data)=0, \old(mode)=0, \result=1, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, bdev={-36893488147419103233:0}, bdev={-36893488147419103233:0}, cmd=1447184708, data=0, disk={4294967302:0}, err=1, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=1, 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, mode=0, ref_cnt=0, usr_data={0:0}, vblk={4294967300:-2}, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4169] RET virtblk_ioctl(virtblk_fops_group0, ldvarg3, ldvarg2, ldvarg1) [L4170] ldv_state_variable_2 = 1 VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=1, 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={-18446744073709551617:0}, ldvarg1={2016:0}, ldvarg2=1447184708, ldvarg3={2015:0}, major=0, ref_cnt=0, tmp={-18446744073709551617:0}, tmp___0=2, tmp___2=1, tmp___3=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4093] tmp___0 = __VERIFIER_nondet_int() [L4095] case 0: [L4125] case 1: VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=1, 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={-18446744073709551617:0}, ldvarg1={2016:0}, ldvarg2=1447184708, ldvarg3={2015:0}, major=0, ref_cnt=0, tmp={-18446744073709551617:0}, tmp___0=1, tmp___2=1, tmp___3=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4126] COND TRUE ldv_state_variable_0 != 0 [L4127] tmp___2 = __VERIFIER_nondet_int() [L4129] case 0: VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=1, 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={-18446744073709551617:0}, ldvarg1={2016:0}, ldvarg2=1447184708, ldvarg3={2015:0}, major=0, ref_cnt=0, tmp={-18446744073709551617:0}, tmp___0=1, tmp___2=0, tmp___3=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4130] COND TRUE ldv_state_variable_0 == 3 && ref_cnt == 0 [L4131] CALL fini() [L4042] FCALL unregister_blkdev((unsigned int )major, "virtblk") [L4043] FCALL unregister_virtio_driver(& virtio_blk) [L4131] RET fini() [L4132] ldv_state_variable_0 = 2 VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldvarg0={-18446744073709551617:0}, ldvarg1={2016:0}, ldvarg2=1447184708, ldvarg3={2015:0}, major=0, ref_cnt=0, tmp={-18446744073709551617:0}, tmp___0=1, tmp___2=0, tmp___3=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4194] CALL ldv_check_final_state() [L4343] COND TRUE ldv_blk_rq != 0 VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4344] CALL ldv_error() VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4236] reach_error() VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 27 procedures, 464 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.2s, OverallIterations: 11, TraceHistogramMax: 12, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 14.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7159 SdHoareTripleChecker+Valid, 11.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6763 mSDsluCounter, 26752 SdHoareTripleChecker+Invalid, 9.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20977 mSDsCounter, 4292 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12208 IncrementalHoareTripleChecker+Invalid, 16500 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4292 mSolverCounterUnsat, 5775 mSDtfsCounter, 12208 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1679 GetRequests, 1521 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3089occurred in iteration=10, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 8796 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 2181 NumberOfCodeBlocks, 2181 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2520 ConstructedInterpolants, 0 QuantifiedInterpolants, 3954 SizeOfPredicates, 15 NumberOfNonLiveVariables, 5230 ConjunctsInSsa, 89 ConjunctsInUnsatCore, 17 InterpolantComputations, 7 PerfectInterpolantSequences, 1520/1720 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-07-21 11:39:03,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8946ad2f029076f7c4f90de60a8c48e069f80fec06a0c6d7a5dc3a1fc4182879 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 11:39:05,381 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 11:39:05,383 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 11:39:05,415 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 11:39:05,415 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 11:39:05,416 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 11:39:05,420 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 11:39:05,422 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 11:39:05,424 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 11:39:05,428 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 11:39:05,429 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 11:39:05,430 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 11:39:05,431 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 11:39:05,432 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 11:39:05,433 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 11:39:05,438 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 11:39:05,439 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 11:39:05,440 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 11:39:05,441 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 11:39:05,445 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 11:39:05,446 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 11:39:05,447 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 11:39:05,448 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 11:39:05,448 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 11:39:05,450 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 11:39:05,452 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 11:39:05,452 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 11:39:05,452 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 11:39:05,453 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 11:39:05,453 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 11:39:05,454 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 11:39:05,454 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 11:39:05,455 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 11:39:05,456 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 11:39:05,457 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 11:39:05,457 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 11:39:05,457 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 11:39:05,458 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 11:39:05,458 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 11:39:05,458 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 11:39:05,458 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 11:39:05,460 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 11:39:05,460 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-07-21 11:39:05,484 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 11:39:05,485 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 11:39:05,485 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 11:39:05,485 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 11:39:05,486 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 11:39:05,486 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 11:39:05,487 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 11:39:05,487 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 11:39:05,487 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 11:39:05,488 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 11:39:05,503 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 11:39:05,503 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 11:39:05,504 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 11:39:05,504 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 11:39:05,504 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 11:39:05,504 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-21 11:39:05,504 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-21 11:39:05,504 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 11:39:05,504 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 11:39:05,505 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 11:39:05,505 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 11:39:05,505 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 11:39:05,505 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 11:39:05,505 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 11:39:05,506 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 11:39:05,506 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 11:39:05,506 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 11:39:05,506 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-21 11:39:05,506 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-21 11:39:05,506 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 11:39:05,507 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 11:39:05,507 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 11:39:05,507 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-21 11:39:05,507 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8946ad2f029076f7c4f90de60a8c48e069f80fec06a0c6d7a5dc3a1fc4182879 [2022-07-21 11:39:05,715 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 11:39:05,734 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 11:39:05,736 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 11:39:05,737 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 11:39:05,738 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 11:39:05,739 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-07-21 11:39:05,786 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c1e40303/b4c639aa7d2246d4a658f89b7f8e9145/FLAG5ce785175 [2022-07-21 11:39:06,387 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 11:39:06,388 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-07-21 11:39:06,404 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c1e40303/b4c639aa7d2246d4a658f89b7f8e9145/FLAG5ce785175 [2022-07-21 11:39:06,816 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c1e40303/b4c639aa7d2246d4a658f89b7f8e9145 [2022-07-21 11:39:06,818 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 11:39:06,819 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 11:39:06,820 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 11:39:06,820 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 11:39:06,822 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 11:39:06,823 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:39:06" (1/1) ... [2022-07-21 11:39:06,824 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e9b06d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:39:06, skipping insertion in model container [2022-07-21 11:39:06,824 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:39:06" (1/1) ... [2022-07-21 11:39:06,828 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 11:39:06,893 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 11:39:07,471 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.ArithmeticException: BigInteger out of int range at java.base/java.math.BigInteger.intValueExact(BigInteger.java:4784) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.checkIfNecessaryMemoryModelAdaption(CHandler.java:1009) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:968) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:279) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:728) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:282) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.result.ExpressionResultTransformer.transformDispatchDecaySwitchRexBoolToInt(ExpressionResultTransformer.java:177) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionCallGivenNameAndArguments(FunctionHandler.java:675) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionCallExpression(FunctionHandler.java:509) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1454) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:267) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1397) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:220) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1081) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1081) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:371) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1470) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:155) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3276) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2361) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:601) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:192) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:115) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-21 11:39:07,476 INFO L158 Benchmark]: Toolchain (without parser) took 656.05ms. Allocated memory was 56.6MB in the beginning and 73.4MB in the end (delta: 16.8MB). Free memory was 29.5MB in the beginning and 48.5MB in the end (delta: -19.0MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. [2022-07-21 11:39:07,478 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 56.6MB. Free memory was 38.8MB in the beginning and 38.8MB in the end (delta: 51.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 11:39:07,478 INFO L158 Benchmark]: CACSL2BoogieTranslator took 654.42ms. Allocated memory was 56.6MB in the beginning and 73.4MB in the end (delta: 16.8MB). Free memory was 29.3MB in the beginning and 48.5MB in the end (delta: -19.2MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. [2022-07-21 11:39:07,480 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.16ms. Allocated memory is still 56.6MB. Free memory was 38.8MB in the beginning and 38.8MB in the end (delta: 51.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 654.42ms. Allocated memory was 56.6MB in the beginning and 73.4MB in the end (delta: 16.8MB). Free memory was 29.3MB in the beginning and 48.5MB in the end (delta: -19.2MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of int range de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: ArithmeticException: BigInteger out of int range: java.base/java.math.BigInteger.intValueExact(BigInteger.java:4784) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ArithmeticException: BigInteger out of int range