./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.7.3/main1_drivers-vhost-vhost_net-ko--32_7a--linux-3.7.3.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fcb8e130 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-linux-3.7.3/main1_drivers-vhost-vhost_net-ko--32_7a--linux-3.7.3.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 f4e2d1a15968d1244ea21dd78c93930ffcefcf7ed108cd6721571103f64feb4f --- Real Ultimate output --- This is Ultimate 0.2.1-dev-fcb8e13 [2021-11-22 21:40:26,495 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 21:40:26,497 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 21:40:26,541 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 21:40:26,541 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 21:40:26,545 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 21:40:26,546 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 21:40:26,548 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 21:40:26,550 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 21:40:26,554 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 21:40:26,555 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 21:40:26,556 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 21:40:26,556 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 21:40:26,558 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 21:40:26,559 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 21:40:26,566 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 21:40:26,566 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 21:40:26,567 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 21:40:26,569 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 21:40:26,573 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 21:40:26,574 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 21:40:26,575 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 21:40:26,576 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 21:40:26,577 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 21:40:26,580 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 21:40:26,580 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 21:40:26,580 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 21:40:26,581 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 21:40:26,582 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 21:40:26,582 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 21:40:26,582 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 21:40:26,583 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 21:40:26,584 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 21:40:26,585 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 21:40:26,586 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 21:40:26,586 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 21:40:26,587 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 21:40:26,587 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 21:40:26,587 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 21:40:26,587 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 21:40:26,588 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 21:40:26,589 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-22 21:40:26,612 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 21:40:26,613 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 21:40:26,613 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 21:40:26,613 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 21:40:26,614 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 21:40:26,615 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 21:40:26,615 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 21:40:26,615 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 21:40:26,615 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-22 21:40:26,615 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 21:40:26,616 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 21:40:26,616 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 21:40:26,616 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 21:40:26,617 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 21:40:26,617 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 21:40:26,617 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 21:40:26,617 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 21:40:26,617 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 21:40:26,617 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-22 21:40:26,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 21:40:26,618 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 21:40:26,618 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 21:40:26,618 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 21:40:26,618 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-22 21:40:26,618 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-22 21:40:26,618 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-22 21:40:26,619 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-22 21:40:26,620 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 21:40:26,620 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 21:40:26,620 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 -> f4e2d1a15968d1244ea21dd78c93930ffcefcf7ed108cd6721571103f64feb4f [2021-11-22 21:40:26,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 21:40:26,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 21:40:26,824 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 21:40:26,825 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 21:40:26,826 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 21:40:26,827 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.7.3/main1_drivers-vhost-vhost_net-ko--32_7a--linux-3.7.3.i [2021-11-22 21:40:26,899 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a778e4f6/f7ebf7719e504d489a9ec7d1b2d766ea/FLAG19af5ba13 [2021-11-22 21:40:27,509 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 21:40:27,509 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.7.3/main1_drivers-vhost-vhost_net-ko--32_7a--linux-3.7.3.i [2021-11-22 21:40:27,546 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a778e4f6/f7ebf7719e504d489a9ec7d1b2d766ea/FLAG19af5ba13 [2021-11-22 21:40:27,905 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a778e4f6/f7ebf7719e504d489a9ec7d1b2d766ea [2021-11-22 21:40:27,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 21:40:27,908 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 21:40:27,910 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 21:40:27,910 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 21:40:27,912 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 21:40:27,913 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:40:27" (1/1) ... [2021-11-22 21:40:27,913 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@557a434d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:27, skipping insertion in model container [2021-11-22 21:40:27,914 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:40:27" (1/1) ... [2021-11-22 21:40:27,918 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 21:40:28,025 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 21:40:29,662 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.7.3/main1_drivers-vhost-vhost_net-ko--32_7a--linux-3.7.3.i[372197,372210] [2021-11-22 21:40:29,756 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 21:40:29,768 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 21:40:30,081 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.7.3/main1_drivers-vhost-vhost_net-ko--32_7a--linux-3.7.3.i[372197,372210] [2021-11-22 21:40:30,088 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 21:40:30,148 INFO L208 MainTranslator]: Completed translation [2021-11-22 21:40:30,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:30 WrapperNode [2021-11-22 21:40:30,149 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 21:40:30,150 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 21:40:30,150 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 21:40:30,151 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 21:40:30,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:30" (1/1) ... [2021-11-22 21:40:30,241 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:30" (1/1) ... [2021-11-22 21:40:31,006 INFO L137 Inliner]: procedures = 335, calls = 2629, calls flagged for inlining = 784, calls inlined = 3769, statements flattened = 44285 [2021-11-22 21:40:31,022 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 21:40:31,023 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 21:40:31,023 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 21:40:31,024 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 21:40:31,030 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:30" (1/1) ... [2021-11-22 21:40:31,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:30" (1/1) ... [2021-11-22 21:40:31,266 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:30" (1/1) ... [2021-11-22 21:40:31,266 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:30" (1/1) ... [2021-11-22 21:40:31,748 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:30" (1/1) ... [2021-11-22 21:40:31,845 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:30" (1/1) ... [2021-11-22 21:40:31,898 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:30" (1/1) ... [2021-11-22 21:40:32,039 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 21:40:32,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 21:40:32,040 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 21:40:32,041 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 21:40:32,041 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:30" (1/1) ... [2021-11-22 21:40:32,047 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 21:40:32,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 21:40:32,064 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) [2021-11-22 21:40:32,069 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 [2021-11-22 21:40:32,088 INFO L130 BoogieDeclarations]: Found specification of procedure handle_tx_net [2021-11-22 21:40:32,088 INFO L138 BoogieDeclarations]: Found implementation of procedure handle_tx_net [2021-11-22 21:40:32,088 INFO L130 BoogieDeclarations]: Found specification of procedure kref_sub [2021-11-22 21:40:32,088 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_sub [2021-11-22 21:40:32,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-22 21:40:32,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-22 21:40:32,089 INFO L130 BoogieDeclarations]: Found specification of procedure handle_tx [2021-11-22 21:40:32,089 INFO L138 BoogieDeclarations]: Found implementation of procedure handle_tx [2021-11-22 21:40:32,089 INFO L130 BoogieDeclarations]: Found specification of procedure __put_user_bad [2021-11-22 21:40:32,089 INFO L130 BoogieDeclarations]: Found specification of procedure tx_poll_start [2021-11-22 21:40:32,089 INFO L138 BoogieDeclarations]: Found implementation of procedure tx_poll_start [2021-11-22 21:40:32,089 INFO L130 BoogieDeclarations]: Found specification of procedure handle_tx_kick [2021-11-22 21:40:32,089 INFO L138 BoogieDeclarations]: Found implementation of procedure handle_tx_kick [2021-11-22 21:40:32,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-22 21:40:32,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-22 21:40:32,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-22 21:40:32,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-22 21:40:32,090 INFO L130 BoogieDeclarations]: Found specification of procedure vhost_dev_cleanup [2021-11-22 21:40:32,090 INFO L138 BoogieDeclarations]: Found implementation of procedure vhost_dev_cleanup [2021-11-22 21:40:32,090 INFO L130 BoogieDeclarations]: Found specification of procedure vhost_zerocopy_callback [2021-11-22 21:40:32,090 INFO L138 BoogieDeclarations]: Found implementation of procedure vhost_zerocopy_callback [2021-11-22 21:40:32,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-22 21:40:32,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-22 21:40:32,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-22 21:40:32,091 INFO L130 BoogieDeclarations]: Found specification of procedure __get_user_bad [2021-11-22 21:40:32,091 INFO L130 BoogieDeclarations]: Found specification of procedure vhost_ubuf_put [2021-11-22 21:40:32,091 INFO L138 BoogieDeclarations]: Found implementation of procedure vhost_ubuf_put [2021-11-22 21:40:32,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-22 21:40:32,091 INFO L130 BoogieDeclarations]: Found specification of procedure kref_put [2021-11-22 21:40:32,091 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_put [2021-11-22 21:40:32,091 INFO L130 BoogieDeclarations]: Found specification of procedure vhost_ubuf_put_and_wait [2021-11-22 21:40:32,091 INFO L138 BoogieDeclarations]: Found implementation of procedure vhost_ubuf_put_and_wait [2021-11-22 21:40:32,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-22 21:40:32,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 21:40:32,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-22 21:40:32,092 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-11-22 21:40:32,092 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2021-11-22 21:40:32,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2021-11-22 21:40:32,092 INFO L130 BoogieDeclarations]: Found specification of procedure vhost_net_release [2021-11-22 21:40:32,092 INFO L138 BoogieDeclarations]: Found implementation of procedure vhost_net_release [2021-11-22 21:40:32,092 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2021-11-22 21:40:32,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2021-11-22 21:40:32,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-22 21:40:32,093 INFO L130 BoogieDeclarations]: Found specification of procedure vhost_poll_start [2021-11-22 21:40:32,093 INFO L138 BoogieDeclarations]: Found implementation of procedure vhost_poll_start [2021-11-22 21:40:32,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 21:40:32,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 21:40:33,010 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 21:40:33,012 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 21:40:40,849 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5786: assume 0 != __copy_from_user_~tmp___0~5#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:40:40,849 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5786: assume !(0 != __copy_from_user_~tmp___0~5#1);__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:40:40,849 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5786-1: assume 0 != __copy_from_user_~tmp___0~5#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:40:40,849 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5786-1: assume !(0 != __copy_from_user_~tmp___0~5#1);__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:40:40,849 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5794: assume __copy_from_user_#t~switch132#1;assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := (if 0 != __copy_from_user_~ret~1#1 then 1 else 0), 0;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-22 21:40:40,849 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5794: assume !__copy_from_user_#t~switch132#1;__copy_from_user_#t~switch132#1 := true; [2021-11-22 21:40:40,849 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5794-1: assume __copy_from_user_#t~switch132#1;assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := (if 0 != __copy_from_user_~ret~1#1 then 1 else 0), 0;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-22 21:40:40,849 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5794-1: assume !__copy_from_user_#t~switch132#1;__copy_from_user_#t~switch132#1 := true; [2021-11-22 21:40:40,849 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5799: assume 0 != __copy_from_user_~tmp___1~2#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:40:40,850 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5799: assume !(0 != __copy_from_user_~tmp___1~2#1);__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:40:40,850 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5799-1: assume 0 != __copy_from_user_~tmp___1~2#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:40:40,850 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5799-1: assume !(0 != __copy_from_user_~tmp___1~2#1);__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:40:40,850 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5807: assume __copy_from_user_#t~switch132#1;assume { :begin_inline_copy_user_generic } true;copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset, copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset, copy_user_generic_#in~len#1 := __copy_from_user_~dst#1.base, __copy_from_user_~dst#1.offset, __copy_from_user_~src#1.base, __copy_from_user_~src#1.offset, __copy_from_user_~size#1;havoc copy_user_generic_#res#1;havoc copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset, copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset, copy_user_generic_~len#1, copy_user_generic_~ret~0#1;copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset := copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset;copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset := copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset;copy_user_generic_~len#1 := copy_user_generic_#in~len#1;havoc copy_user_generic_~ret~0#1;copy_user_generic_#res#1 := copy_user_generic_~ret~0#1 % 4294967296; [2021-11-22 21:40:40,850 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5807: assume !__copy_from_user_#t~switch132#1; [2021-11-22 21:40:40,850 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5807-1: assume __copy_from_user_#t~switch132#1;assume { :begin_inline_copy_user_generic } true;copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset, copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset, copy_user_generic_#in~len#1 := __copy_from_user_~dst#1.base, __copy_from_user_~dst#1.offset, __copy_from_user_~src#1.base, __copy_from_user_~src#1.offset, __copy_from_user_~size#1;havoc copy_user_generic_#res#1;havoc copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset, copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset, copy_user_generic_~len#1, copy_user_generic_~ret~0#1;copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset := copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset;copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset := copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset;copy_user_generic_~len#1 := copy_user_generic_#in~len#1;havoc copy_user_generic_~ret~0#1;copy_user_generic_#res#1 := copy_user_generic_~ret~0#1 % 4294967296; [2021-11-22 21:40:40,850 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5807-1: assume !__copy_from_user_#t~switch132#1; [2021-11-22 21:40:40,850 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1218: assume __copy_from_user_#t~switch132#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:40:40,850 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1219: assume !__copy_from_user_#t~switch132#1;__copy_from_user_#t~switch132#1 := __copy_from_user_#t~switch132#1 || 2 == __copy_from_user_~size#1; [2021-11-22 21:40:40,850 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5825-2: havoc __copy_to_user_#t~switch137#1; [2021-11-22 21:40:40,850 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5825-3: havoc __copy_to_user_#t~switch137#1; [2021-11-22 21:40:40,850 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5825: havoc __copy_to_user_#t~switch137#1; [2021-11-22 21:40:40,851 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5825-1: havoc __copy_to_user_#t~switch137#1; [2021-11-22 21:40:40,851 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5830: assume __copy_to_user_#t~switch137#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:40:40,851 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5830: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := __copy_to_user_#t~switch137#1 || 4 == __copy_to_user_~size#1; [2021-11-22 21:40:40,851 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5830-3: assume __copy_to_user_#t~switch137#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:40:40,851 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5830-3: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := __copy_to_user_#t~switch137#1 || 4 == __copy_to_user_~size#1; [2021-11-22 21:40:40,851 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5830-1: assume __copy_to_user_#t~switch137#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:40:40,851 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5830-1: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := __copy_to_user_#t~switch137#1 || 4 == __copy_to_user_~size#1; [2021-11-22 21:40:40,851 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5830-2: assume __copy_to_user_#t~switch137#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:40:40,851 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5830-2: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := __copy_to_user_#t~switch137#1 || 4 == __copy_to_user_~size#1; [2021-11-22 21:40:40,851 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5834: assume __copy_to_user_#t~switch137#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:40:40,851 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5834: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := __copy_to_user_#t~switch137#1 || 8 == __copy_to_user_~size#1; [2021-11-22 21:40:40,851 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5834-3: assume __copy_to_user_#t~switch137#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:40:40,851 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5834-3: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := __copy_to_user_#t~switch137#1 || 8 == __copy_to_user_~size#1; [2021-11-22 21:40:40,852 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5834-1: assume __copy_to_user_#t~switch137#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:40:40,852 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5834-1: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := __copy_to_user_#t~switch137#1 || 8 == __copy_to_user_~size#1; [2021-11-22 21:40:40,852 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5834-2: assume __copy_to_user_#t~switch137#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:40:40,852 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5834-2: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := __copy_to_user_#t~switch137#1 || 8 == __copy_to_user_~size#1; [2021-11-22 21:40:40,852 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5838: assume __copy_to_user_#t~switch137#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:40:40,852 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5838: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := __copy_to_user_#t~switch137#1 || 10 == __copy_to_user_~size#1; [2021-11-22 21:40:40,852 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5838-3: assume __copy_to_user_#t~switch137#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:40:40,852 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5838-3: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := __copy_to_user_#t~switch137#1 || 10 == __copy_to_user_~size#1; [2021-11-22 21:40:40,852 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5838-1: assume __copy_to_user_#t~switch137#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:40:40,852 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5838-1: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := __copy_to_user_#t~switch137#1 || 10 == __copy_to_user_~size#1; [2021-11-22 21:40:40,852 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5838-2: assume __copy_to_user_#t~switch137#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:40:40,852 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5838-2: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := __copy_to_user_#t~switch137#1 || 10 == __copy_to_user_~size#1; [2021-11-22 21:40:40,852 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5842: assume __copy_to_user_#t~switch137#1;assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := (if 0 != __copy_to_user_~ret~2#1 then 1 else 0), 0;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-22 21:40:40,853 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5842: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := __copy_to_user_#t~switch137#1 || 16 == __copy_to_user_~size#1; [2021-11-22 21:40:40,853 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5842-3: assume __copy_to_user_#t~switch137#1;assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := (if 0 != __copy_to_user_~ret~2#1 then 1 else 0), 0;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-22 21:40:40,853 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5842-3: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := __copy_to_user_#t~switch137#1 || 16 == __copy_to_user_~size#1; [2021-11-22 21:40:40,853 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5842-1: assume __copy_to_user_#t~switch137#1;assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := (if 0 != __copy_to_user_~ret~2#1 then 1 else 0), 0;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-22 21:40:40,853 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5842-1: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := __copy_to_user_#t~switch137#1 || 16 == __copy_to_user_~size#1; [2021-11-22 21:40:40,853 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5842-2: assume __copy_to_user_#t~switch137#1;assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := (if 0 != __copy_to_user_~ret~2#1 then 1 else 0), 0;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-22 21:40:40,853 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5842-2: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := __copy_to_user_#t~switch137#1 || 16 == __copy_to_user_~size#1; [2021-11-22 21:40:40,853 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5846: assume 0 != __copy_to_user_~tmp___0~6#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:40:40,853 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5846: assume !(0 != __copy_to_user_~tmp___0~6#1);__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:40:40,853 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5846-3: assume 0 != __copy_to_user_~tmp___0~6#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:40:40,853 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5846-3: assume !(0 != __copy_to_user_~tmp___0~6#1);__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:40:40,853 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5846-1: assume 0 != __copy_to_user_~tmp___0~6#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:40:40,853 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5846-1: assume !(0 != __copy_to_user_~tmp___0~6#1);__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:40:40,854 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5846-2: assume 0 != __copy_to_user_~tmp___0~6#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:40:40,854 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5846-2: assume !(0 != __copy_to_user_~tmp___0~6#1);__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:40:40,854 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5854: assume __copy_to_user_#t~switch137#1;assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := (if 0 != __copy_to_user_~ret~2#1 then 1 else 0), 0;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-22 21:40:40,854 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5854: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := true; [2021-11-22 21:40:40,854 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5854-3: assume __copy_to_user_#t~switch137#1;assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := (if 0 != __copy_to_user_~ret~2#1 then 1 else 0), 0;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-22 21:40:40,854 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5854-3: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := true; [2021-11-22 21:40:40,854 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5854-1: assume __copy_to_user_#t~switch137#1;assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := (if 0 != __copy_to_user_~ret~2#1 then 1 else 0), 0;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-22 21:40:40,854 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5854-1: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := true; [2021-11-22 21:40:40,854 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5854-2: assume __copy_to_user_#t~switch137#1;assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := (if 0 != __copy_to_user_~ret~2#1 then 1 else 0), 0;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-22 21:40:40,854 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5854-2: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := true; [2021-11-22 21:40:40,854 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5858: assume 0 != __copy_to_user_~tmp___1~3#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:40:40,854 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5858: assume !(0 != __copy_to_user_~tmp___1~3#1);__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:40:40,854 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5858-3: assume 0 != __copy_to_user_~tmp___1~3#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:40:40,855 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5858-3: assume !(0 != __copy_to_user_~tmp___1~3#1);__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:40:40,855 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5858-1: assume 0 != __copy_to_user_~tmp___1~3#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:40:40,855 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5858-1: assume !(0 != __copy_to_user_~tmp___1~3#1);__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:40:40,855 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5858-2: assume 0 != __copy_to_user_~tmp___1~3#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:40:40,857 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5858-2: assume !(0 != __copy_to_user_~tmp___1~3#1);__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:40:40,857 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5866: assume __copy_to_user_#t~switch137#1;assume { :begin_inline_copy_user_generic } true;copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset, copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset, copy_user_generic_#in~len#1 := __copy_to_user_~dst#1.base, __copy_to_user_~dst#1.offset, __copy_to_user_~src#1.base, __copy_to_user_~src#1.offset, __copy_to_user_~size#1;havoc copy_user_generic_#res#1;havoc copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset, copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset, copy_user_generic_~len#1, copy_user_generic_~ret~0#1;copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset := copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset;copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset := copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset;copy_user_generic_~len#1 := copy_user_generic_#in~len#1;havoc copy_user_generic_~ret~0#1;copy_user_generic_#res#1 := copy_user_generic_~ret~0#1 % 4294967296; [2021-11-22 21:40:40,857 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5866: assume !__copy_to_user_#t~switch137#1; [2021-11-22 21:40:40,857 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5866-3: assume __copy_to_user_#t~switch137#1;assume { :begin_inline_copy_user_generic } true;copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset, copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset, copy_user_generic_#in~len#1 := __copy_to_user_~dst#1.base, __copy_to_user_~dst#1.offset, __copy_to_user_~src#1.base, __copy_to_user_~src#1.offset, __copy_to_user_~size#1;havoc copy_user_generic_#res#1;havoc copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset, copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset, copy_user_generic_~len#1, copy_user_generic_~ret~0#1;copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset := copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset;copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset := copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset;copy_user_generic_~len#1 := copy_user_generic_#in~len#1;havoc copy_user_generic_~ret~0#1;copy_user_generic_#res#1 := copy_user_generic_~ret~0#1 % 4294967296; [2021-11-22 21:40:40,857 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5866-3: assume !__copy_to_user_#t~switch137#1; [2021-11-22 21:40:40,858 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5866-1: assume __copy_to_user_#t~switch137#1;assume { :begin_inline_copy_user_generic } true;copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset, copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset, copy_user_generic_#in~len#1 := __copy_to_user_~dst#1.base, __copy_to_user_~dst#1.offset, __copy_to_user_~src#1.base, __copy_to_user_~src#1.offset, __copy_to_user_~size#1;havoc copy_user_generic_#res#1;havoc copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset, copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset, copy_user_generic_~len#1, copy_user_generic_~ret~0#1;copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset := copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset;copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset := copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset;copy_user_generic_~len#1 := copy_user_generic_#in~len#1;havoc copy_user_generic_~ret~0#1;copy_user_generic_#res#1 := copy_user_generic_~ret~0#1 % 4294967296; [2021-11-22 21:40:40,858 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5866-1: assume !__copy_to_user_#t~switch137#1; [2021-11-22 21:40:40,858 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5866-2: assume __copy_to_user_#t~switch137#1;assume { :begin_inline_copy_user_generic } true;copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset, copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset, copy_user_generic_#in~len#1 := __copy_to_user_~dst#1.base, __copy_to_user_~dst#1.offset, __copy_to_user_~src#1.base, __copy_to_user_~src#1.offset, __copy_to_user_~size#1;havoc copy_user_generic_#res#1;havoc copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset, copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset, copy_user_generic_~len#1, copy_user_generic_~ret~0#1;copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset := copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset;copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset := copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset;copy_user_generic_~len#1 := copy_user_generic_#in~len#1;havoc copy_user_generic_~ret~0#1;copy_user_generic_#res#1 := copy_user_generic_~ret~0#1 % 4294967296; [2021-11-22 21:40:40,858 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5866-2: assume !__copy_to_user_#t~switch137#1; [2021-11-22 21:40:40,858 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##164: assume !__copy_from_user_#t~switch132#1;__copy_from_user_#t~switch132#1 := __copy_from_user_#t~switch132#1 || 2 == __copy_from_user_~size#1; [2021-11-22 21:40:40,859 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##163: assume __copy_from_user_#t~switch132#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:40:40,859 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1876: assume __copy_to_user_#t~switch137#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:40:40,859 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1877: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := __copy_to_user_#t~switch137#1 || 2 == __copy_to_user_~size#1; [2021-11-22 21:40:40,859 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1811: assume __copy_to_user_#t~switch137#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:40:40,859 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1812: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := __copy_to_user_#t~switch137#1 || 2 == __copy_to_user_~size#1; [2021-11-22 21:40:40,860 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##757: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := __copy_to_user_#t~switch137#1 || 2 == __copy_to_user_~size#1; [2021-11-22 21:40:40,860 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##756: assume __copy_to_user_#t~switch137#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:40:40,860 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5701-3: __copy_to_user_#t~ret140#1 := copy_user_generic_#res#1;assume { :end_inline_copy_user_generic } true;__copy_to_user_~tmp___2~4#1 := __copy_to_user_#t~ret140#1;havoc __copy_to_user_#t~ret140#1;__copy_to_user_#res#1 := (if __copy_to_user_~tmp___2~4#1 % 18446744073709551616 % 4294967296 <= 2147483647 then __copy_to_user_~tmp___2~4#1 % 18446744073709551616 % 4294967296 else __copy_to_user_~tmp___2~4#1 % 18446744073709551616 % 4294967296 - 4294967296); [2021-11-22 21:40:40,860 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5701-1: __copy_from_user_#t~ret135#1 := copy_user_generic_#res#1;assume { :end_inline_copy_user_generic } true;__copy_from_user_~tmp___2~3#1 := __copy_from_user_#t~ret135#1;havoc __copy_from_user_#t~ret135#1;__copy_from_user_#res#1 := (if __copy_from_user_~tmp___2~3#1 % 18446744073709551616 % 4294967296 <= 2147483647 then __copy_from_user_~tmp___2~3#1 % 18446744073709551616 % 4294967296 else __copy_from_user_~tmp___2~3#1 % 18446744073709551616 % 4294967296 - 4294967296); [2021-11-22 21:40:40,860 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5701-7: __copy_from_user_#t~ret135#1 := copy_user_generic_#res#1;assume { :end_inline_copy_user_generic } true;__copy_from_user_~tmp___2~3#1 := __copy_from_user_#t~ret135#1;havoc __copy_from_user_#t~ret135#1;__copy_from_user_#res#1 := (if __copy_from_user_~tmp___2~3#1 % 18446744073709551616 % 4294967296 <= 2147483647 then __copy_from_user_~tmp___2~3#1 % 18446744073709551616 % 4294967296 else __copy_from_user_~tmp___2~3#1 % 18446744073709551616 % 4294967296 - 4294967296); [2021-11-22 21:40:40,860 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5701-5: __copy_to_user_#t~ret140#1 := copy_user_generic_#res#1;assume { :end_inline_copy_user_generic } true;__copy_to_user_~tmp___2~4#1 := __copy_to_user_#t~ret140#1;havoc __copy_to_user_#t~ret140#1;__copy_to_user_#res#1 := (if __copy_to_user_~tmp___2~4#1 % 18446744073709551616 % 4294967296 <= 2147483647 then __copy_to_user_~tmp___2~4#1 % 18446744073709551616 % 4294967296 else __copy_to_user_~tmp___2~4#1 % 18446744073709551616 % 4294967296 - 4294967296); [2021-11-22 21:40:40,861 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5701-11: __copy_to_user_#t~ret140#1 := copy_user_generic_#res#1;assume { :end_inline_copy_user_generic } true;__copy_to_user_~tmp___2~4#1 := __copy_to_user_#t~ret140#1;havoc __copy_to_user_#t~ret140#1;__copy_to_user_#res#1 := (if __copy_to_user_~tmp___2~4#1 % 18446744073709551616 % 4294967296 <= 2147483647 then __copy_to_user_~tmp___2~4#1 % 18446744073709551616 % 4294967296 else __copy_to_user_~tmp___2~4#1 % 18446744073709551616 % 4294967296 - 4294967296); [2021-11-22 21:40:40,861 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5701-9: __copy_to_user_#t~ret140#1 := copy_user_generic_#res#1;assume { :end_inline_copy_user_generic } true;__copy_to_user_~tmp___2~4#1 := __copy_to_user_#t~ret140#1;havoc __copy_to_user_#t~ret140#1;__copy_to_user_#res#1 := (if __copy_to_user_~tmp___2~4#1 % 18446744073709551616 % 4294967296 <= 2147483647 then __copy_to_user_~tmp___2~4#1 % 18446744073709551616 % 4294967296 else __copy_to_user_~tmp___2~4#1 % 18446744073709551616 % 4294967296 - 4294967296); [2021-11-22 21:40:40,861 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L10999-19: __copy_from_user_#t~ret133#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;assume -9223372036854775808 <= __copy_from_user_#t~ret133#1 && __copy_from_user_#t~ret133#1 <= 9223372036854775807;__copy_from_user_~tmp___0~5#1 := __copy_from_user_#t~ret133#1;havoc __copy_from_user_#t~ret133#1; [2021-11-22 21:40:40,861 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L10999-20: __copy_from_user_#t~ret134#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;assume -9223372036854775808 <= __copy_from_user_#t~ret134#1 && __copy_from_user_#t~ret134#1 <= 9223372036854775807;__copy_from_user_~tmp___1~2#1 := __copy_from_user_#t~ret134#1;havoc __copy_from_user_#t~ret134#1; [2021-11-22 21:40:40,861 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L10999-85: __copy_to_user_#t~ret139#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;assume -9223372036854775808 <= __copy_to_user_#t~ret139#1 && __copy_to_user_#t~ret139#1 <= 9223372036854775807;__copy_to_user_~tmp___1~3#1 := __copy_to_user_#t~ret139#1;havoc __copy_to_user_#t~ret139#1; [2021-11-22 21:40:40,862 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L10999-84: __copy_to_user_#t~ret138#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;assume -9223372036854775808 <= __copy_to_user_#t~ret138#1 && __copy_to_user_#t~ret138#1 <= 9223372036854775807;__copy_to_user_~tmp___0~6#1 := __copy_to_user_#t~ret138#1;havoc __copy_to_user_#t~ret138#1; [2021-11-22 21:40:40,862 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L10999-79: __copy_to_user_#t~ret139#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;assume -9223372036854775808 <= __copy_to_user_#t~ret139#1 && __copy_to_user_#t~ret139#1 <= 9223372036854775807;__copy_to_user_~tmp___1~3#1 := __copy_to_user_#t~ret139#1;havoc __copy_to_user_#t~ret139#1; [2021-11-22 21:40:40,862 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L10999-78: __copy_to_user_#t~ret138#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;assume -9223372036854775808 <= __copy_to_user_#t~ret138#1 && __copy_to_user_#t~ret138#1 <= 9223372036854775807;__copy_to_user_~tmp___0~6#1 := __copy_to_user_#t~ret138#1;havoc __copy_to_user_#t~ret138#1; [2021-11-22 21:40:40,863 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L10999-121: __copy_from_user_#t~ret134#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;assume -9223372036854775808 <= __copy_from_user_#t~ret134#1 && __copy_from_user_#t~ret134#1 <= 9223372036854775807;__copy_from_user_~tmp___1~2#1 := __copy_from_user_#t~ret134#1;havoc __copy_from_user_#t~ret134#1; [2021-11-22 21:40:40,863 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L10999-120: __copy_from_user_#t~ret133#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;assume -9223372036854775808 <= __copy_from_user_#t~ret133#1 && __copy_from_user_#t~ret133#1 <= 9223372036854775807;__copy_from_user_~tmp___0~5#1 := __copy_from_user_#t~ret133#1;havoc __copy_from_user_#t~ret133#1; [2021-11-22 21:40:40,863 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L10999-179: __copy_to_user_#t~ret138#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;assume -9223372036854775808 <= __copy_to_user_#t~ret138#1 && __copy_to_user_#t~ret138#1 <= 9223372036854775807;__copy_to_user_~tmp___0~6#1 := __copy_to_user_#t~ret138#1;havoc __copy_to_user_#t~ret138#1; [2021-11-22 21:40:40,863 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L10999-180: __copy_to_user_#t~ret139#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;assume -9223372036854775808 <= __copy_to_user_#t~ret139#1 && __copy_to_user_#t~ret139#1 <= 9223372036854775807;__copy_to_user_~tmp___1~3#1 := __copy_to_user_#t~ret139#1;havoc __copy_to_user_#t~ret139#1; [2021-11-22 21:40:40,863 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L10999-186: __copy_to_user_#t~ret139#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;assume -9223372036854775808 <= __copy_to_user_#t~ret139#1 && __copy_to_user_#t~ret139#1 <= 9223372036854775807;__copy_to_user_~tmp___1~3#1 := __copy_to_user_#t~ret139#1;havoc __copy_to_user_#t~ret139#1; [2021-11-22 21:40:40,863 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L10999-185: __copy_to_user_#t~ret138#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;assume -9223372036854775808 <= __copy_to_user_#t~ret138#1 && __copy_to_user_#t~ret138#1 <= 9223372036854775807;__copy_to_user_~tmp___0~6#1 := __copy_to_user_#t~ret138#1;havoc __copy_to_user_#t~ret138#1; [2021-11-22 21:40:40,864 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##822: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := __copy_to_user_#t~switch137#1 || 2 == __copy_to_user_~size#1; [2021-11-22 21:40:40,864 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##821: assume __copy_to_user_#t~switch137#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:40:40,864 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5760-1: havoc __copy_from_user_#t~switch132#1; [2021-11-22 21:40:40,864 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5760: havoc __copy_from_user_#t~switch132#1; [2021-11-22 21:40:40,865 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5766: assume __copy_from_user_#t~switch132#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:40:40,865 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5766: assume !__copy_from_user_#t~switch132#1;__copy_from_user_#t~switch132#1 := __copy_from_user_#t~switch132#1 || 4 == __copy_from_user_~size#1; [2021-11-22 21:40:40,865 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5766-1: assume __copy_from_user_#t~switch132#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:40:40,866 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5766-1: assume !__copy_from_user_#t~switch132#1;__copy_from_user_#t~switch132#1 := __copy_from_user_#t~switch132#1 || 4 == __copy_from_user_~size#1; [2021-11-22 21:40:40,866 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5771: assume __copy_from_user_#t~switch132#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:40:40,866 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5771: assume !__copy_from_user_#t~switch132#1;__copy_from_user_#t~switch132#1 := __copy_from_user_#t~switch132#1 || 8 == __copy_from_user_~size#1; [2021-11-22 21:40:40,866 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5771-1: assume __copy_from_user_#t~switch132#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:40:40,866 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5771-1: assume !__copy_from_user_#t~switch132#1;__copy_from_user_#t~switch132#1 := __copy_from_user_#t~switch132#1 || 8 == __copy_from_user_~size#1; [2021-11-22 21:40:40,866 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5776-1: assume __copy_from_user_#t~switch132#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:40:40,866 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5776-1: assume !__copy_from_user_#t~switch132#1;__copy_from_user_#t~switch132#1 := __copy_from_user_#t~switch132#1 || 10 == __copy_from_user_~size#1; [2021-11-22 21:40:40,867 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5776: assume __copy_from_user_#t~switch132#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:40:40,867 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5776: assume !__copy_from_user_#t~switch132#1;__copy_from_user_#t~switch132#1 := __copy_from_user_#t~switch132#1 || 10 == __copy_from_user_~size#1; [2021-11-22 21:40:40,867 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5781: assume __copy_from_user_#t~switch132#1;assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := (if 0 != __copy_from_user_~ret~1#1 then 1 else 0), 0;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-22 21:40:40,867 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5781: assume !__copy_from_user_#t~switch132#1;__copy_from_user_#t~switch132#1 := __copy_from_user_#t~switch132#1 || 16 == __copy_from_user_~size#1; [2021-11-22 21:40:40,867 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5781-1: assume __copy_from_user_#t~switch132#1;assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := (if 0 != __copy_from_user_~ret~1#1 then 1 else 0), 0;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-22 21:40:40,867 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5781-1: assume !__copy_from_user_#t~switch132#1;__copy_from_user_#t~switch132#1 := __copy_from_user_#t~switch132#1 || 16 == __copy_from_user_~size#1; [2021-11-22 21:40:45,437 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5786: assume 0 != __copy_from_user_~tmp___0~5#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:40:45,437 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5786: assume !(0 != __copy_from_user_~tmp___0~5#1);__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:40:45,437 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5794: assume __copy_from_user_#t~switch132#1;assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := (if 0 != __copy_from_user_~ret~1#1 then 1 else 0), 0;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-22 21:40:45,438 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5794: assume !__copy_from_user_#t~switch132#1;__copy_from_user_#t~switch132#1 := true; [2021-11-22 21:40:45,438 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5799: assume 0 != __copy_from_user_~tmp___1~2#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:40:45,438 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5799: assume !(0 != __copy_from_user_~tmp___1~2#1);__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:40:45,438 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5807: assume __copy_from_user_#t~switch132#1;assume { :begin_inline_copy_user_generic } true;copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset, copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset, copy_user_generic_#in~len#1 := __copy_from_user_~dst#1.base, __copy_from_user_~dst#1.offset, __copy_from_user_~src#1.base, __copy_from_user_~src#1.offset, __copy_from_user_~size#1;havoc copy_user_generic_#res#1;havoc copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset, copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset, copy_user_generic_~len#1, copy_user_generic_~ret~0#1;copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset := copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset;copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset := copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset;copy_user_generic_~len#1 := copy_user_generic_#in~len#1;havoc copy_user_generic_~ret~0#1;copy_user_generic_#res#1 := copy_user_generic_~ret~0#1 % 4294967296; [2021-11-22 21:40:45,438 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5807: assume !__copy_from_user_#t~switch132#1; [2021-11-22 21:40:45,438 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##352: assume !__copy_from_user_#t~switch132#1;__copy_from_user_#t~switch132#1 := __copy_from_user_#t~switch132#1 || 2 == __copy_from_user_~size#1; [2021-11-22 21:40:45,438 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##351: assume __copy_from_user_#t~switch132#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:40:45,438 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5701-1: __copy_from_user_#t~ret135#1 := copy_user_generic_#res#1;assume { :end_inline_copy_user_generic } true;__copy_from_user_~tmp___2~3#1 := __copy_from_user_#t~ret135#1;havoc __copy_from_user_#t~ret135#1;__copy_from_user_#res#1 := (if __copy_from_user_~tmp___2~3#1 % 18446744073709551616 % 4294967296 <= 2147483647 then __copy_from_user_~tmp___2~3#1 % 18446744073709551616 % 4294967296 else __copy_from_user_~tmp___2~3#1 % 18446744073709551616 % 4294967296 - 4294967296); [2021-11-22 21:40:45,438 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L10999-29: __copy_from_user_#t~ret134#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;assume -9223372036854775808 <= __copy_from_user_#t~ret134#1 && __copy_from_user_#t~ret134#1 <= 9223372036854775807;__copy_from_user_~tmp___1~2#1 := __copy_from_user_#t~ret134#1;havoc __copy_from_user_#t~ret134#1; [2021-11-22 21:40:45,439 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L10999-28: __copy_from_user_#t~ret133#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;assume -9223372036854775808 <= __copy_from_user_#t~ret133#1 && __copy_from_user_#t~ret133#1 <= 9223372036854775807;__copy_from_user_~tmp___0~5#1 := __copy_from_user_#t~ret133#1;havoc __copy_from_user_#t~ret133#1; [2021-11-22 21:40:45,439 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5760: havoc __copy_from_user_#t~switch132#1; [2021-11-22 21:40:45,439 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5766: assume __copy_from_user_#t~switch132#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:40:45,439 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5766: assume !__copy_from_user_#t~switch132#1;__copy_from_user_#t~switch132#1 := __copy_from_user_#t~switch132#1 || 4 == __copy_from_user_~size#1; [2021-11-22 21:40:45,439 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5771: assume __copy_from_user_#t~switch132#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:40:45,439 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5771: assume !__copy_from_user_#t~switch132#1;__copy_from_user_#t~switch132#1 := __copy_from_user_#t~switch132#1 || 8 == __copy_from_user_~size#1; [2021-11-22 21:40:45,439 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5776: assume __copy_from_user_#t~switch132#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:40:45,439 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5776: assume !__copy_from_user_#t~switch132#1;__copy_from_user_#t~switch132#1 := __copy_from_user_#t~switch132#1 || 10 == __copy_from_user_~size#1; [2021-11-22 21:40:45,439 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5781: assume __copy_from_user_#t~switch132#1;assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := (if 0 != __copy_from_user_~ret~1#1 then 1 else 0), 0;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-22 21:40:45,439 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5781: assume !__copy_from_user_#t~switch132#1;__copy_from_user_#t~switch132#1 := __copy_from_user_#t~switch132#1 || 16 == __copy_from_user_~size#1; [2021-11-22 21:40:52,883 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 21:40:52,922 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 21:40:52,922 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-22 21:40:52,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:40:52 BoogieIcfgContainer [2021-11-22 21:40:52,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 21:40:52,932 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-22 21:40:52,933 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-22 21:40:52,936 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-22 21:40:52,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:40:27" (1/3) ... [2021-11-22 21:40:52,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2413c23c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:40:52, skipping insertion in model container [2021-11-22 21:40:52,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:30" (2/3) ... [2021-11-22 21:40:52,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2413c23c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:40:52, skipping insertion in model container [2021-11-22 21:40:52,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:40:52" (3/3) ... [2021-11-22 21:40:52,939 INFO L111 eAbstractionObserver]: Analyzing ICFG main1_drivers-vhost-vhost_net-ko--32_7a--linux-3.7.3.i [2021-11-22 21:40:52,946 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-22 21:40:52,946 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 78 error locations. [2021-11-22 21:40:53,005 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-22 21:40:53,012 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-22 21:40:53,013 INFO L340 AbstractCegarLoop]: Starting to check reachability of 78 error locations. [2021-11-22 21:40:53,108 INFO L276 IsEmpty]: Start isEmpty. Operand has 8518 states, 8394 states have (on average 1.3690731474862998) internal successors, (11492), 8479 states have internal predecessors, (11492), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2021-11-22 21:40:53,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-22 21:40:53,123 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:40:53,124 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:40:53,124 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 75 more)] === [2021-11-22 21:40:53,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:40:53,128 INFO L85 PathProgramCache]: Analyzing trace with hash -326986334, now seen corresponding path program 1 times [2021-11-22 21:40:53,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:40:53,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753763477] [2021-11-22 21:40:53,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:40:53,135 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:40:53,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:40:53,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:40:53,465 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:40:53,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753763477] [2021-11-22 21:40:53,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753763477] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:40:53,466 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:40:53,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 21:40:53,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284313091] [2021-11-22 21:40:53,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:40:53,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 21:40:53,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:40:53,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 21:40:53,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:40:53,501 INFO L87 Difference]: Start difference. First operand has 8518 states, 8394 states have (on average 1.3690731474862998) internal successors, (11492), 8479 states have internal predecessors, (11492), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:40:53,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:40:53,980 INFO L93 Difference]: Finished difference Result 16946 states and 23047 transitions. [2021-11-22 21:40:53,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 21:40:53,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-11-22 21:40:53,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:40:54,023 INFO L225 Difference]: With dead ends: 16946 [2021-11-22 21:40:54,023 INFO L226 Difference]: Without dead ends: 8354 [2021-11-22 21:40:54,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:40:54,048 INFO L933 BasicCegarLoop]: 11355 mSDtfsCounter, 11346 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11346 SdHoareTripleChecker+Valid, 11355 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 21:40:54,049 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11346 Valid, 11355 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 21:40:54,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8354 states. [2021-11-22 21:40:54,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8354 to 8354. [2021-11-22 21:40:54,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8354 states, 8232 states have (on average 1.3520408163265305) internal successors, (11130), 8315 states have internal predecessors, (11130), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2021-11-22 21:40:54,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8354 states to 8354 states and 11192 transitions. [2021-11-22 21:40:54,306 INFO L78 Accepts]: Start accepts. Automaton has 8354 states and 11192 transitions. Word has length 12 [2021-11-22 21:40:54,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:40:54,307 INFO L470 AbstractCegarLoop]: Abstraction has 8354 states and 11192 transitions. [2021-11-22 21:40:54,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:40:54,308 INFO L276 IsEmpty]: Start isEmpty. Operand 8354 states and 11192 transitions. [2021-11-22 21:40:54,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-22 21:40:54,309 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:40:54,309 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:40:54,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-22 21:40:54,310 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 75 more)] === [2021-11-22 21:40:54,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:40:54,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1546616919, now seen corresponding path program 1 times [2021-11-22 21:40:54,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:40:54,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274791132] [2021-11-22 21:40:54,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:40:54,313 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:40:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:40:54,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:40:54,403 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:40:54,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274791132] [2021-11-22 21:40:54,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274791132] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:40:54,404 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:40:54,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 21:40:54,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475281256] [2021-11-22 21:40:54,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:40:54,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 21:40:54,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:40:54,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 21:40:54,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:40:54,407 INFO L87 Difference]: Start difference. First operand 8354 states and 11192 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:40:54,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:40:54,556 INFO L93 Difference]: Finished difference Result 8354 states and 11192 transitions. [2021-11-22 21:40:54,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 21:40:54,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-22 21:40:54,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:40:54,583 INFO L225 Difference]: With dead ends: 8354 [2021-11-22 21:40:54,583 INFO L226 Difference]: Without dead ends: 8352 [2021-11-22 21:40:54,591 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:40:54,592 INFO L933 BasicCegarLoop]: 11189 mSDtfsCounter, 11179 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11179 SdHoareTripleChecker+Valid, 11189 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 21:40:54,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11179 Valid, 11189 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 21:40:54,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8352 states. [2021-11-22 21:40:54,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8352 to 8352. [2021-11-22 21:40:54,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8352 states, 8231 states have (on average 1.3519620945207145) internal successors, (11128), 8313 states have internal predecessors, (11128), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2021-11-22 21:40:54,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8352 states to 8352 states and 11190 transitions. [2021-11-22 21:40:54,773 INFO L78 Accepts]: Start accepts. Automaton has 8352 states and 11190 transitions. Word has length 13 [2021-11-22 21:40:54,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:40:54,774 INFO L470 AbstractCegarLoop]: Abstraction has 8352 states and 11190 transitions. [2021-11-22 21:40:54,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:40:54,774 INFO L276 IsEmpty]: Start isEmpty. Operand 8352 states and 11190 transitions. [2021-11-22 21:40:54,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-22 21:40:54,775 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:40:54,775 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:40:54,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-22 21:40:54,775 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 75 more)] === [2021-11-22 21:40:54,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:40:54,776 INFO L85 PathProgramCache]: Analyzing trace with hash -700459379, now seen corresponding path program 1 times [2021-11-22 21:40:54,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:40:54,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005963398] [2021-11-22 21:40:54,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:40:54,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:40:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:40:54,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:40:54,826 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:40:54,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005963398] [2021-11-22 21:40:54,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005963398] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:40:54,827 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:40:54,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 21:40:54,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802238779] [2021-11-22 21:40:54,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:40:54,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 21:40:54,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:40:54,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 21:40:54,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:40:54,828 INFO L87 Difference]: Start difference. First operand 8352 states and 11190 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:40:55,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:40:55,088 INFO L93 Difference]: Finished difference Result 8352 states and 11190 transitions. [2021-11-22 21:40:55,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 21:40:55,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-11-22 21:40:55,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:40:55,151 INFO L225 Difference]: With dead ends: 8352 [2021-11-22 21:40:55,151 INFO L226 Difference]: Without dead ends: 8350 [2021-11-22 21:40:55,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:40:55,155 INFO L933 BasicCegarLoop]: 11187 mSDtfsCounter, 11176 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11176 SdHoareTripleChecker+Valid, 11187 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 21:40:55,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11176 Valid, 11187 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 21:40:55,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8350 states. [2021-11-22 21:40:55,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8350 to 8350. [2021-11-22 21:40:55,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8350 states, 8230 states have (on average 1.3518833535844472) internal successors, (11126), 8311 states have internal predecessors, (11126), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2021-11-22 21:40:55,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8350 states to 8350 states and 11188 transitions. [2021-11-22 21:40:55,388 INFO L78 Accepts]: Start accepts. Automaton has 8350 states and 11188 transitions. Word has length 14 [2021-11-22 21:40:55,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:40:55,388 INFO L470 AbstractCegarLoop]: Abstraction has 8350 states and 11188 transitions. [2021-11-22 21:40:55,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:40:55,389 INFO L276 IsEmpty]: Start isEmpty. Operand 8350 states and 11188 transitions. [2021-11-22 21:40:55,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-22 21:40:55,390 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:40:55,390 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:40:55,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-22 21:40:55,391 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 75 more)] === [2021-11-22 21:40:55,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:40:55,392 INFO L85 PathProgramCache]: Analyzing trace with hash -239379404, now seen corresponding path program 1 times [2021-11-22 21:40:55,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:40:55,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207112578] [2021-11-22 21:40:55,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:40:55,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:40:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:40:55,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:40:55,469 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:40:55,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207112578] [2021-11-22 21:40:55,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207112578] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:40:55,469 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:40:55,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 21:40:55,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247809087] [2021-11-22 21:40:55,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:40:55,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 21:40:55,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:40:55,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 21:40:55,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:40:55,473 INFO L87 Difference]: Start difference. First operand 8350 states and 11188 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:40:56,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:40:56,026 INFO L93 Difference]: Finished difference Result 17758 states and 23765 transitions. [2021-11-22 21:40:56,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 21:40:56,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-22 21:40:56,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:40:56,061 INFO L225 Difference]: With dead ends: 17758 [2021-11-22 21:40:56,062 INFO L226 Difference]: Without dead ends: 9409 [2021-11-22 21:40:56,084 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:40:56,085 INFO L933 BasicCegarLoop]: 12303 mSDtfsCounter, 3199 mSDsluCounter, 9085 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3199 SdHoareTripleChecker+Valid, 21388 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 21:40:56,085 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3199 Valid, 21388 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 21:40:56,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9409 states. [2021-11-22 21:40:56,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9409 to 9373. [2021-11-22 21:40:56,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9373 states, 9244 states have (on average 1.337083513630463) internal successors, (12360), 9307 states have internal predecessors, (12360), 43 states have call successors, (43), 25 states have call predecessors, (43), 25 states have return successors, (65), 49 states have call predecessors, (65), 43 states have call successors, (65) [2021-11-22 21:40:56,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9373 states to 9373 states and 12468 transitions. [2021-11-22 21:40:56,400 INFO L78 Accepts]: Start accepts. Automaton has 9373 states and 12468 transitions. Word has length 15 [2021-11-22 21:40:56,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:40:56,400 INFO L470 AbstractCegarLoop]: Abstraction has 9373 states and 12468 transitions. [2021-11-22 21:40:56,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:40:56,400 INFO L276 IsEmpty]: Start isEmpty. Operand 9373 states and 12468 transitions. [2021-11-22 21:40:56,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-22 21:40:56,402 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:40:56,402 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:40:56,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-22 21:40:56,402 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting vhost_net_releaseErr1ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 75 more)] === [2021-11-22 21:40:56,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:40:56,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1987060743, now seen corresponding path program 1 times [2021-11-22 21:40:56,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:40:56,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795008437] [2021-11-22 21:40:56,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:40:56,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:40:56,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:40:56,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:40:56,473 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:40:56,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795008437] [2021-11-22 21:40:56,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795008437] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:40:56,473 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:40:56,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 21:40:56,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883878644] [2021-11-22 21:40:56,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:40:56,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 21:40:56,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:40:56,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 21:40:56,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:40:56,475 INFO L87 Difference]: Start difference. First operand 9373 states and 12468 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:40:56,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:40:56,882 INFO L93 Difference]: Finished difference Result 23663 states and 31291 transitions. [2021-11-22 21:40:56,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 21:40:56,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-22 21:40:56,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:40:56,923 INFO L225 Difference]: With dead ends: 23663 [2021-11-22 21:40:56,923 INFO L226 Difference]: Without dead ends: 14300 [2021-11-22 21:40:56,947 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:40:56,948 INFO L933 BasicCegarLoop]: 11146 mSDtfsCounter, 5331 mSDsluCounter, 11074 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5341 SdHoareTripleChecker+Valid, 22220 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 21:40:56,949 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5341 Valid, 22220 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 21:40:56,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14300 states. [2021-11-22 21:40:57,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14300 to 10864. [2021-11-22 21:40:57,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10864 states, 10735 states have (on average 1.327806241266884) internal successors, (14254), 10798 states have internal predecessors, (14254), 43 states have call successors, (43), 25 states have call predecessors, (43), 25 states have return successors, (65), 49 states have call predecessors, (65), 43 states have call successors, (65) [2021-11-22 21:40:57,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10864 states to 10864 states and 14362 transitions. [2021-11-22 21:40:57,234 INFO L78 Accepts]: Start accepts. Automaton has 10864 states and 14362 transitions. Word has length 30 [2021-11-22 21:40:57,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:40:57,235 INFO L470 AbstractCegarLoop]: Abstraction has 10864 states and 14362 transitions. [2021-11-22 21:40:57,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:40:57,236 INFO L276 IsEmpty]: Start isEmpty. Operand 10864 states and 14362 transitions. [2021-11-22 21:40:57,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-22 21:40:57,241 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:40:57,241 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:40:57,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-22 21:40:57,241 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 75 more)] === [2021-11-22 21:40:57,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:40:57,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1806724487, now seen corresponding path program 1 times [2021-11-22 21:40:57,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:40:57,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252718244] [2021-11-22 21:40:57,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:40:57,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:40:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:40:57,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:40:57,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:40:57,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252718244] [2021-11-22 21:40:57,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252718244] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:40:57,314 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:40:57,314 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 21:40:57,314 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754980379] [2021-11-22 21:40:57,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:40:57,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 21:40:57,315 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:40:57,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 21:40:57,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:40:57,315 INFO L87 Difference]: Start difference. First operand 10864 states and 14362 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:40:57,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:40:57,957 INFO L93 Difference]: Finished difference Result 21808 states and 28803 transitions. [2021-11-22 21:40:57,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 21:40:57,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-11-22 21:40:57,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:40:57,985 INFO L225 Difference]: With dead ends: 21808 [2021-11-22 21:40:57,985 INFO L226 Difference]: Without dead ends: 10954 [2021-11-22 21:40:58,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:40:58,013 INFO L933 BasicCegarLoop]: 10913 mSDtfsCounter, 0 mSDsluCounter, 10611 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21524 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 21:40:58,013 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 21524 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 21:40:58,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10954 states. [2021-11-22 21:40:58,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10954 to 10864. [2021-11-22 21:40:58,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10864 states, 10735 states have (on average 1.3026548672566372) internal successors, (13984), 10798 states have internal predecessors, (13984), 43 states have call successors, (43), 25 states have call predecessors, (43), 25 states have return successors, (65), 49 states have call predecessors, (65), 43 states have call successors, (65) [2021-11-22 21:40:58,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10864 states to 10864 states and 14092 transitions. [2021-11-22 21:40:58,265 INFO L78 Accepts]: Start accepts. Automaton has 10864 states and 14092 transitions. Word has length 34 [2021-11-22 21:40:58,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:40:58,265 INFO L470 AbstractCegarLoop]: Abstraction has 10864 states and 14092 transitions. [2021-11-22 21:40:58,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:40:58,265 INFO L276 IsEmpty]: Start isEmpty. Operand 10864 states and 14092 transitions. [2021-11-22 21:40:58,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-22 21:40:58,267 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:40:58,267 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:40:58,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-22 21:40:58,267 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 75 more)] === [2021-11-22 21:40:58,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:40:58,267 INFO L85 PathProgramCache]: Analyzing trace with hash -869387609, now seen corresponding path program 1 times [2021-11-22 21:40:58,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:40:58,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235610741] [2021-11-22 21:40:58,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:40:58,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:40:58,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 21:40:58,355 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-22 21:40:58,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 21:40:58,470 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-22 21:40:58,470 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-22 21:40:58,471 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (77 of 78 remaining) [2021-11-22 21:40:58,472 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (76 of 78 remaining) [2021-11-22 21:40:58,473 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION (75 of 78 remaining) [2021-11-22 21:40:58,473 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (74 of 78 remaining) [2021-11-22 21:40:58,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~VOIDErr3ASSERT_VIOLATIONERROR_FUNCTION (73 of 78 remaining) [2021-11-22 21:40:58,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location handle_txErr0ASSERT_VIOLATIONERROR_FUNCTION (72 of 78 remaining) [2021-11-22 21:40:58,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location handle_txErr1ASSERT_VIOLATIONERROR_FUNCTION (71 of 78 remaining) [2021-11-22 21:40:58,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location handle_txErr2ASSERT_VIOLATIONERROR_FUNCTION (70 of 78 remaining) [2021-11-22 21:40:58,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location handle_txErr3ASSERT_VIOLATIONERROR_FUNCTION (69 of 78 remaining) [2021-11-22 21:40:58,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location vhost_net_releaseErr0ASSERT_VIOLATIONERROR_FUNCTION (68 of 78 remaining) [2021-11-22 21:40:58,475 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location vhost_net_releaseErr1ASSERT_VIOLATIONERROR_FUNCTION (67 of 78 remaining) [2021-11-22 21:40:58,475 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location vhost_net_releaseErr2ASSERT_VIOLATIONERROR_FUNCTION (66 of 78 remaining) [2021-11-22 21:40:58,477 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location vhost_net_releaseErr3ASSERT_VIOLATIONERROR_FUNCTION (65 of 78 remaining) [2021-11-22 21:40:58,477 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (64 of 78 remaining) [2021-11-22 21:40:58,477 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (63 of 78 remaining) [2021-11-22 21:40:58,477 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (62 of 78 remaining) [2021-11-22 21:40:58,478 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (61 of 78 remaining) [2021-11-22 21:40:58,479 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (60 of 78 remaining) [2021-11-22 21:40:58,479 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (59 of 78 remaining) [2021-11-22 21:40:58,479 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (58 of 78 remaining) [2021-11-22 21:40:58,479 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (57 of 78 remaining) [2021-11-22 21:40:58,479 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (56 of 78 remaining) [2021-11-22 21:40:58,479 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (55 of 78 remaining) [2021-11-22 21:40:58,480 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (54 of 78 remaining) [2021-11-22 21:40:58,480 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (53 of 78 remaining) [2021-11-22 21:40:58,480 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (52 of 78 remaining) [2021-11-22 21:40:58,480 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (51 of 78 remaining) [2021-11-22 21:40:58,480 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (50 of 78 remaining) [2021-11-22 21:40:58,480 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (49 of 78 remaining) [2021-11-22 21:40:58,480 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (48 of 78 remaining) [2021-11-22 21:40:58,481 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION (47 of 78 remaining) [2021-11-22 21:40:58,481 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION (46 of 78 remaining) [2021-11-22 21:40:58,481 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION (45 of 78 remaining) [2021-11-22 21:40:58,481 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION (44 of 78 remaining) [2021-11-22 21:40:58,481 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION (43 of 78 remaining) [2021-11-22 21:40:58,481 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION (42 of 78 remaining) [2021-11-22 21:40:58,481 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION (41 of 78 remaining) [2021-11-22 21:40:58,482 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION (40 of 78 remaining) [2021-11-22 21:40:58,482 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION (39 of 78 remaining) [2021-11-22 21:40:58,482 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION (38 of 78 remaining) [2021-11-22 21:40:58,482 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION (37 of 78 remaining) [2021-11-22 21:40:58,482 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION (36 of 78 remaining) [2021-11-22 21:40:58,482 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION (35 of 78 remaining) [2021-11-22 21:40:58,482 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION (34 of 78 remaining) [2021-11-22 21:40:58,482 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION (33 of 78 remaining) [2021-11-22 21:40:58,483 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION (32 of 78 remaining) [2021-11-22 21:40:58,483 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION (31 of 78 remaining) [2021-11-22 21:40:58,483 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION (30 of 78 remaining) [2021-11-22 21:40:58,483 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION (29 of 78 remaining) [2021-11-22 21:40:58,483 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION (28 of 78 remaining) [2021-11-22 21:40:58,483 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION (27 of 78 remaining) [2021-11-22 21:40:58,483 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION (26 of 78 remaining) [2021-11-22 21:40:58,484 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION (25 of 78 remaining) [2021-11-22 21:40:58,484 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION (24 of 78 remaining) [2021-11-22 21:40:58,484 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION (23 of 78 remaining) [2021-11-22 21:40:58,484 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION (22 of 78 remaining) [2021-11-22 21:40:58,485 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION (21 of 78 remaining) [2021-11-22 21:40:58,485 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION (20 of 78 remaining) [2021-11-22 21:40:58,485 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION (19 of 78 remaining) [2021-11-22 21:40:58,485 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION (18 of 78 remaining) [2021-11-22 21:40:58,485 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION (17 of 78 remaining) [2021-11-22 21:40:58,485 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION (16 of 78 remaining) [2021-11-22 21:40:58,486 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION (15 of 78 remaining) [2021-11-22 21:40:58,486 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (14 of 78 remaining) [2021-11-22 21:40:58,486 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION (13 of 78 remaining) [2021-11-22 21:40:58,486 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION (12 of 78 remaining) [2021-11-22 21:40:58,486 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONERROR_FUNCTION (11 of 78 remaining) [2021-11-22 21:40:58,486 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONERROR_FUNCTION (10 of 78 remaining) [2021-11-22 21:40:58,486 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONERROR_FUNCTION (9 of 78 remaining) [2021-11-22 21:40:58,487 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONERROR_FUNCTION (8 of 78 remaining) [2021-11-22 21:40:58,487 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONERROR_FUNCTION (7 of 78 remaining) [2021-11-22 21:40:58,487 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONERROR_FUNCTION (6 of 78 remaining) [2021-11-22 21:40:58,487 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONERROR_FUNCTION (5 of 78 remaining) [2021-11-22 21:40:58,487 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONERROR_FUNCTION (4 of 78 remaining) [2021-11-22 21:40:58,487 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONERROR_FUNCTION (3 of 78 remaining) [2021-11-22 21:40:58,488 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONERROR_FUNCTION (2 of 78 remaining) [2021-11-22 21:40:58,488 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONERROR_FUNCTION (1 of 78 remaining) [2021-11-22 21:40:58,488 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONERROR_FUNCTION (0 of 78 remaining) [2021-11-22 21:40:58,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-22 21:40:58,491 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:40:58,493 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-22 21:40:58,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:40:58 BoogieIcfgContainer [2021-11-22 21:40:58,561 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-22 21:40:58,562 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-22 21:40:58,562 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-22 21:40:58,562 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-22 21:40:58,562 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:40:52" (3/4) ... [2021-11-22 21:40:58,564 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-22 21:40:58,564 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-22 21:40:58,565 INFO L158 Benchmark]: Toolchain (without parser) took 30656.83ms. Allocated memory was 100.7MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 58.7MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2021-11-22 21:40:58,565 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 100.7MB. Free memory is still 58.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-22 21:40:58,565 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2239.77ms. Allocated memory was 100.7MB in the beginning and 232.8MB in the end (delta: 132.1MB). Free memory was 58.4MB in the beginning and 145.7MB in the end (delta: -87.3MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. [2021-11-22 21:40:58,566 INFO L158 Benchmark]: Boogie Procedure Inliner took 872.53ms. Allocated memory was 232.8MB in the beginning and 427.8MB in the end (delta: 195.0MB). Free memory was 145.7MB in the beginning and 271.6MB in the end (delta: -125.9MB). Peak memory consumption was 132.8MB. Max. memory is 16.1GB. [2021-11-22 21:40:58,566 INFO L158 Benchmark]: Boogie Preprocessor took 1016.33ms. Allocated memory is still 427.8MB. Free memory was 271.6MB in the beginning and 166.0MB in the end (delta: 105.6MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. [2021-11-22 21:40:58,566 INFO L158 Benchmark]: RCFGBuilder took 20891.05ms. Allocated memory was 427.8MB in the beginning and 1.8GB in the end (delta: 1.3GB). Free memory was 164.9MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 471.9MB. Max. memory is 16.1GB. [2021-11-22 21:40:58,566 INFO L158 Benchmark]: TraceAbstraction took 5628.70ms. Allocated memory was 1.8GB in the beginning and 2.5GB in the end (delta: 727.7MB). Free memory was 1.2GB in the beginning and 1.3GB in the end (delta: -89.1MB). Peak memory consumption was 640.7MB. Max. memory is 16.1GB. [2021-11-22 21:40:58,566 INFO L158 Benchmark]: Witness Printer took 3.00ms. Allocated memory is still 2.5GB. Free memory is still 1.3GB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-22 21:40:58,567 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 100.7MB. Free memory is still 58.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2239.77ms. Allocated memory was 100.7MB in the beginning and 232.8MB in the end (delta: 132.1MB). Free memory was 58.4MB in the beginning and 145.7MB in the end (delta: -87.3MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 872.53ms. Allocated memory was 232.8MB in the beginning and 427.8MB in the end (delta: 195.0MB). Free memory was 145.7MB in the beginning and 271.6MB in the end (delta: -125.9MB). Peak memory consumption was 132.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 1016.33ms. Allocated memory is still 427.8MB. Free memory was 271.6MB in the beginning and 166.0MB in the end (delta: 105.6MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. * RCFGBuilder took 20891.05ms. Allocated memory was 427.8MB in the beginning and 1.8GB in the end (delta: 1.3GB). Free memory was 164.9MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 471.9MB. Max. memory is 16.1GB. * TraceAbstraction took 5628.70ms. Allocated memory was 1.8GB in the beginning and 2.5GB in the end (delta: 727.7MB). Free memory was 1.2GB in the beginning and 1.3GB in the end (delta: -89.1MB). Peak memory consumption was 640.7MB. Max. memory is 16.1GB. * Witness Printer took 3.00ms. Allocated memory is still 2.5GB. Free memory is still 1.3GB. There was no memory consumed. Max. memory is 16.1GB. * 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: 10992]: 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 10595. Possible FailurePath: [L5971] static unsigned int vhost_zcopy_mask ; [L9348] static int experimental_zcopytx ; [L10590-L10593] static struct file_operations const vhost_net_fops = {& __this_module, & noop_llseek, 0, 0, 0, 0, 0, 0, & vhost_net_ioctl, & vhost_net_compat_ioctl, 0, & vhost_net_open, 0, & vhost_net_release, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}; [L10594-L10595] static struct miscdevice vhost_net_misc = {238, "vhost-net", & vhost_net_fops, {0, 0}, 0, 0, 0, (unsigned short)0}; [L10620] int LDV_IN_INTERRUPT ; [L11002] static int ldv_mutex_cred_guard_mutex ; [L11109] static int ldv_mutex_lock ; [L11216] static int ldv_mutex_mtx ; [L11323] static int ldv_mutex_mutex ; VAL [__this_module={18446744073709551619:18446744073709551620}, experimental_zcopytx=0, LDV_IN_INTERRUPT=0, ldv_mutex_cred_guard_mutex=0, ldv_mutex_lock=0, ldv_mutex_mtx=0, ldv_mutex_mutex=0, vhost_net_fops={215:0}, vhost_net_misc={216:0}, vhost_zcopy_mask=0] [L10623] struct inode *var_group1 ; [L10624] struct file *var_group2 ; [L10625] unsigned int var_vhost_net_ioctl_27_p1 ; [L10626] unsigned long var_vhost_net_ioctl_27_p2 ; [L10627] unsigned int var_vhost_net_compat_ioctl_28_p1 ; [L10628] unsigned long var_vhost_net_compat_ioctl_28_p2 ; [L10629] int res_vhost_net_open_13 ; [L10630] int ldv_s_vhost_net_fops_file_operations ; [L10631] int tmp ; [L10632] int tmp___0 ; [L10633] int tmp___1 ; [L10635] ldv_s_vhost_net_fops_file_operations = 0 [L10636] LDV_IN_INTERRUPT = 1 [L10637] CALL ldv_initialize() [L11433] ldv_mutex_cred_guard_mutex = 1 [L11434] ldv_mutex_lock = 1 [L11435] ldv_mutex_mtx = 1 [L11436] ldv_mutex_mutex = 1 VAL [__this_module={18446744073709551619:18446744073709551620}, experimental_zcopytx=0, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=1, vhost_net_fops={215:0}, vhost_net_misc={216:0}, vhost_zcopy_mask=0] [L10637] RET ldv_initialize() [L10638] FCALL ldv_handler_precall() [L10639] CALL, EXPR vhost_net_init() [L10598] int tmp ; VAL [__this_module={18446744073709551619:18446744073709551620}, experimental_zcopytx=0, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=1, vhost_net_fops={215:0}, vhost_net_misc={216:0}, vhost_zcopy_mask=0] [L10600] COND FALSE !(experimental_zcopytx != 0) VAL [__this_module={18446744073709551619:18446744073709551620}, experimental_zcopytx=0, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=1, vhost_net_fops={215:0}, vhost_net_misc={216:0}, vhost_zcopy_mask=0] [L10604] CALL, EXPR misc_register(& vhost_net_misc) [L11595] return __VERIFIER_nondet_int(); [L10604] RET, EXPR misc_register(& vhost_net_misc) [L10604] tmp = misc_register(& vhost_net_misc) [L10605] return (tmp); VAL [\result=0, __this_module={18446744073709551619:18446744073709551620}, experimental_zcopytx=0, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=1, tmp=0, vhost_net_fops={215:0}, vhost_net_misc={216:0}, vhost_zcopy_mask=0] [L10639] RET, EXPR vhost_net_init() [L10639] tmp = vhost_net_init() [L10640] COND FALSE !(tmp != 0) VAL [__this_module={18446744073709551619:18446744073709551620}, experimental_zcopytx=0, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=1, ldv_s_vhost_net_fops_file_operations=0, tmp=0, vhost_net_fops={215:0}, vhost_net_misc={216:0}, vhost_zcopy_mask=0] [L10682] tmp___1 = __VERIFIER_nondet_int() [L10683] COND TRUE tmp___1 != 0 || ldv_s_vhost_net_fops_file_operations != 0 VAL [__this_module={18446744073709551619:18446744073709551620}, experimental_zcopytx=0, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=1, ldv_s_vhost_net_fops_file_operations=0, tmp=0, tmp___1=-2, vhost_net_fops={215:0}, vhost_net_misc={216:0}, vhost_zcopy_mask=0] [L10646] tmp___0 = __VERIFIER_nondet_int() [L10648] case 0: [L10661] case 1: [L10669] case 2: [L10670] FCALL ldv_handler_precall() [L10671] CALL vhost_net_ioctl(var_group2, var_vhost_net_ioctl_27_p1, var_vhost_net_ioctl_27_p2) [L10521] struct vhost_net *n ; [L10522] void *argp ; [L10523] u64 *featurep ; [L10524] struct vhost_vring_file backend ; [L10525] u64 features ; [L10526] int r ; [L10527] unsigned long tmp ; [L10528] long tmp___0 ; [L10529] int tmp___1 ; [L10530] unsigned long tmp___2 ; [L10531] int tmp___3 ; [L10532] long tmp___4 ; [L10533] long tmp___5 ; [L10535] EXPR f->private_data [L10535] n = (struct vhost_net *)f->private_data [L10536] argp = (void *)arg [L10537] featurep = (u64 *)argp [L10539] case 1074310960U: [L10547] case 2148052736U: [L10555] case 1074310912U: [L10567] case 44802U: [L10568] CALL vhost_net_reset_owner(n) [L10445] struct socket *tx_sock ; [L10446] struct socket *rx_sock ; [L10447] long err ; [L10449] tx_sock = 0 [L10450] rx_sock = 0 [L10451] CALL ldv_mutex_lock_66(& n->dev.mutex) [L10919] CALL ldv_mutex_lock_mutex(ldv_func_arg1) [L11361] COND TRUE ldv_mutex_mutex == 1 VAL [__this_module={18446744073709551619:18446744073709551620}, experimental_zcopytx=0, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=1, lock={18446744073709551615:16}, lock={18446744073709551615:16}, vhost_net_fops={215:0}, vhost_net_misc={216:0}, vhost_zcopy_mask=0] [L11365] ldv_mutex_mutex = 2 VAL [__this_module={18446744073709551619:18446744073709551620}, experimental_zcopytx=0, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=2, lock={18446744073709551615:16}, lock={18446744073709551615:16}, vhost_net_fops={215:0}, vhost_net_misc={216:0}, vhost_zcopy_mask=0] [L10919] RET ldv_mutex_lock_mutex(ldv_func_arg1) [L10920] FCALL mutex_lock(ldv_func_arg1) [L10451] RET ldv_mutex_lock_66(& n->dev.mutex) [L10452] CALL, EXPR vhost_dev_check_owner(& n->dev) [L6410] struct task_struct *tmp ; [L6412] CALL, EXPR get_current() [L5283] struct task_struct *pfo_ret__ ; [L5286] case 1UL: [L5289] case 2UL: [L5292] case 4UL: [L5295] case 8UL: VAL [__this_module={18446744073709551619:18446744073709551620}, experimental_zcopytx=0, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=2, vhost_net_fops={215:0}, vhost_net_misc={216:0}, vhost_zcopy_mask=0] [L5302] return (pfo_ret__); VAL [\result={18446744073709551617:-5}, __this_module={18446744073709551619:18446744073709551620}, experimental_zcopytx=0, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=2, pfo_ret__={18446744073709551617:-5}, vhost_net_fops={215:0}, vhost_net_misc={216:0}, vhost_zcopy_mask=0] [L6412] RET, EXPR get_current() [L6412] tmp = get_current() [L6413] EXPR dev->mm [L6413] EXPR tmp->mm VAL [__this_module={18446744073709551619:18446744073709551620}, dev={18446744073709551615:0}, dev={18446744073709551615:0}, dev->mm={0:0}, experimental_zcopytx=0, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=2, tmp={18446744073709551617:-5}, tmp->mm={0:0}, vhost_net_fops={215:0}, vhost_net_misc={216:0}, vhost_zcopy_mask=0] [L6413] EXPR (unsigned long )dev->mm == (unsigned long )tmp->mm ? 0L : -1L VAL [(unsigned long )dev->mm == (unsigned long )tmp->mm ? 0L : -1L=0, __this_module={18446744073709551619:18446744073709551620}, dev={18446744073709551615:0}, dev={18446744073709551615:0}, dev->mm={0:0}, experimental_zcopytx=0, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=2, tmp={18446744073709551617:-5}, tmp->mm={0:0}, vhost_net_fops={215:0}, vhost_net_misc={216:0}, vhost_zcopy_mask=0] [L6413] return ((unsigned long )dev->mm == (unsigned long )tmp->mm ? 0L : -1L); [L10452] RET, EXPR vhost_dev_check_owner(& n->dev) [L10452] err = vhost_dev_check_owner(& n->dev) [L10453] COND FALSE !(err != 0L) [L10457] CALL vhost_net_stop(n, & tx_sock, & rx_sock) [L10183] CALL vhost_net_stop_vq(n, (struct vhost_virtqueue *)(& n->vqs) + 1UL) [L10155] struct socket *sock ; [L10156] bool __warned ; [L10157] int tmp ; [L10158] int tmp___0 ; [L10160] CALL ldv_mutex_lock_56(& vq->mutex) [L10839] CALL ldv_mutex_lock_mutex(ldv_func_arg1) [L11361] COND FALSE !(ldv_mutex_mutex == 1) [L11363] CALL ldv_error() [L10992] reach_error() VAL [__this_module={18446744073709551619:18446744073709551620}, experimental_zcopytx=0, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=2, vhost_net_fops={215:0}, vhost_net_misc={216:0}, vhost_zcopy_mask=0] - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 8518 locations, 78 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 42241 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42231 mSDsluCounter, 98863 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30770 mSDsCounter, 416 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 585 IncrementalHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 416 mSolverCounterUnsat, 68093 mSDtfsCounter, 585 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10864occurred in iteration=5, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 6 MinimizatonAttempts, 3562 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 155 NumberOfCodeBlocks, 155 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 223 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 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 [2021-11-22 21:40:58,616 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-linux-3.7.3/main1_drivers-vhost-vhost_net-ko--32_7a--linux-3.7.3.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 f4e2d1a15968d1244ea21dd78c93930ffcefcf7ed108cd6721571103f64feb4f --- Real Ultimate output --- This is Ultimate 0.2.1-dev-fcb8e13 [2021-11-22 21:41:00,415 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 21:41:00,418 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 21:41:00,450 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 21:41:00,451 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 21:41:00,453 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 21:41:00,454 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 21:41:00,458 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 21:41:00,460 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 21:41:00,464 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 21:41:00,465 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 21:41:00,468 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 21:41:00,468 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 21:41:00,470 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 21:41:00,471 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 21:41:00,474 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 21:41:00,474 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 21:41:00,477 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 21:41:00,479 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 21:41:00,483 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 21:41:00,484 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 21:41:00,485 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 21:41:00,486 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 21:41:00,487 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 21:41:00,492 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 21:41:00,492 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 21:41:00,492 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 21:41:00,493 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 21:41:00,507 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 21:41:00,508 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 21:41:00,508 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 21:41:00,509 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 21:41:00,509 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 21:41:00,510 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 21:41:00,510 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 21:41:00,510 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 21:41:00,511 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 21:41:00,511 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 21:41:00,511 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 21:41:00,512 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 21:41:00,512 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 21:41:00,514 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-22 21:41:00,533 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 21:41:00,534 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 21:41:00,534 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 21:41:00,535 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 21:41:00,536 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 21:41:00,536 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 21:41:00,536 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 21:41:00,536 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 21:41:00,536 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 21:41:00,537 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 21:41:00,537 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 21:41:00,537 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 21:41:00,537 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-22 21:41:00,537 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-22 21:41:00,538 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-22 21:41:00,538 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 21:41:00,538 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 21:41:00,538 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 21:41:00,538 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 21:41:00,538 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 21:41:00,538 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-22 21:41:00,538 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 21:41:00,539 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 21:41:00,539 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 21:41:00,539 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 21:41:00,539 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-22 21:41:00,539 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-22 21:41:00,539 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-22 21:41:00,539 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-22 21:41:00,539 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 21:41:00,540 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 21:41:00,540 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-22 21:41:00,540 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 -> f4e2d1a15968d1244ea21dd78c93930ffcefcf7ed108cd6721571103f64feb4f [2021-11-22 21:41:00,824 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 21:41:00,845 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 21:41:00,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 21:41:00,848 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 21:41:00,848 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 21:41:00,849 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.7.3/main1_drivers-vhost-vhost_net-ko--32_7a--linux-3.7.3.i [2021-11-22 21:41:00,890 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/286d3067a/c036315e3d6c4cd0b5a46a4e21f7966d/FLAG120ab0b31 [2021-11-22 21:41:01,521 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 21:41:01,522 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.7.3/main1_drivers-vhost-vhost_net-ko--32_7a--linux-3.7.3.i [2021-11-22 21:41:01,564 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/286d3067a/c036315e3d6c4cd0b5a46a4e21f7966d/FLAG120ab0b31 [2021-11-22 21:41:01,642 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/286d3067a/c036315e3d6c4cd0b5a46a4e21f7966d [2021-11-22 21:41:01,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 21:41:01,644 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 21:41:01,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 21:41:01,645 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 21:41:01,648 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 21:41:01,648 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:41:01" (1/1) ... [2021-11-22 21:41:01,649 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e51b485 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:01, skipping insertion in model container [2021-11-22 21:41:01,649 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:41:01" (1/1) ... [2021-11-22 21:41:01,654 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 21:41:01,760 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 21:41:03,246 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.7.3/main1_drivers-vhost-vhost_net-ko--32_7a--linux-3.7.3.i[372197,372210] [2021-11-22 21:41:03,324 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 21:41:03,344 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-11-22 21:41:03,400 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 21:41:03,651 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.7.3/main1_drivers-vhost-vhost_net-ko--32_7a--linux-3.7.3.i[372197,372210] [2021-11-22 21:41:03,658 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 21:41:03,666 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 21:41:04,021 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.7.3/main1_drivers-vhost-vhost_net-ko--32_7a--linux-3.7.3.i[372197,372210] [2021-11-22 21:41:04,027 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 21:41:04,095 INFO L208 MainTranslator]: Completed translation [2021-11-22 21:41:04,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:04 WrapperNode [2021-11-22 21:41:04,096 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 21:41:04,097 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 21:41:04,097 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 21:41:04,097 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 21:41:04,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:04" (1/1) ... [2021-11-22 21:41:04,173 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:04" (1/1) ... [2021-11-22 21:41:04,789 INFO L137 Inliner]: procedures = 350, calls = 2627, calls flagged for inlining = 797, calls inlined = 4116, statements flattened = 46542 [2021-11-22 21:41:04,790 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 21:41:04,790 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 21:41:04,790 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 21:41:04,790 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 21:41:04,809 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:04" (1/1) ... [2021-11-22 21:41:04,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:04" (1/1) ... [2021-11-22 21:41:05,011 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:04" (1/1) ... [2021-11-22 21:41:05,011 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:04" (1/1) ... [2021-11-22 21:41:05,603 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:04" (1/1) ... [2021-11-22 21:41:05,757 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:04" (1/1) ... [2021-11-22 21:41:05,821 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:04" (1/1) ... [2021-11-22 21:41:05,990 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 21:41:05,991 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 21:41:05,991 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 21:41:05,991 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 21:41:05,992 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:04" (1/1) ... [2021-11-22 21:41:05,998 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 21:41:06,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 21:41:06,052 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) [2021-11-22 21:41:06,061 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 [2021-11-22 21:41:06,083 INFO L130 BoogieDeclarations]: Found specification of procedure handle_tx_net [2021-11-22 21:41:06,083 INFO L138 BoogieDeclarations]: Found implementation of procedure handle_tx_net [2021-11-22 21:41:06,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-22 21:41:06,084 INFO L130 BoogieDeclarations]: Found specification of procedure kref_sub [2021-11-22 21:41:06,084 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_sub [2021-11-22 21:41:06,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-22 21:41:06,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-22 21:41:06,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-22 21:41:06,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2021-11-22 21:41:06,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-22 21:41:06,085 INFO L130 BoogieDeclarations]: Found specification of procedure handle_tx [2021-11-22 21:41:06,085 INFO L138 BoogieDeclarations]: Found implementation of procedure handle_tx [2021-11-22 21:41:06,085 INFO L130 BoogieDeclarations]: Found specification of procedure __put_user_bad [2021-11-22 21:41:06,085 INFO L130 BoogieDeclarations]: Found specification of procedure handle_tx_kick [2021-11-22 21:41:06,085 INFO L138 BoogieDeclarations]: Found implementation of procedure handle_tx_kick [2021-11-22 21:41:06,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-22 21:41:06,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-22 21:41:06,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-22 21:41:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-11-22 21:41:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2021-11-22 21:41:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-22 21:41:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-22 21:41:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-22 21:41:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure vhost_zerocopy_callback [2021-11-22 21:41:06,086 INFO L138 BoogieDeclarations]: Found implementation of procedure vhost_zerocopy_callback [2021-11-22 21:41:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2021-11-22 21:41:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-22 21:41:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-22 21:41:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure __get_user_bad [2021-11-22 21:41:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure vhost_ubuf_put [2021-11-22 21:41:06,087 INFO L138 BoogieDeclarations]: Found implementation of procedure vhost_ubuf_put [2021-11-22 21:41:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2021-11-22 21:41:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2021-11-22 21:41:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2021-11-22 21:41:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2021-11-22 21:41:06,088 INFO L130 BoogieDeclarations]: Found specification of procedure kref_put [2021-11-22 21:41:06,088 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_put [2021-11-22 21:41:06,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-22 21:41:06,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 21:41:06,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-22 21:41:06,088 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-11-22 21:41:06,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2021-11-22 21:41:06,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2021-11-22 21:41:06,089 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2021-11-22 21:41:06,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2021-11-22 21:41:06,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2021-11-22 21:41:06,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2021-11-22 21:41:06,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 21:41:06,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 21:41:06,829 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 21:41:06,831 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 21:42:00,684 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5786: assume 0bv64 != __copy_from_user_~tmp___0~5#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:42:00,684 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5786: assume !(0bv64 != __copy_from_user_~tmp___0~5#1);__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:42:00,685 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5786-1: assume 0bv64 != __copy_from_user_~tmp___0~5#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:42:00,685 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5786-1: assume !(0bv64 != __copy_from_user_~tmp___0~5#1);__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:42:00,685 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5794: assume __copy_from_user_#t~switch132#1;assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := ~sign_extendFrom32To64((if 0bv32 != __copy_from_user_~ret~1#1 then 1bv32 else 0bv32)), 0bv64;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-22 21:42:00,685 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5794: assume !__copy_from_user_#t~switch132#1;__copy_from_user_#t~switch132#1 := true; [2021-11-22 21:42:00,685 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5794-1: assume __copy_from_user_#t~switch132#1;assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := ~sign_extendFrom32To64((if 0bv32 != __copy_from_user_~ret~1#1 then 1bv32 else 0bv32)), 0bv64;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-22 21:42:00,685 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5794-1: assume !__copy_from_user_#t~switch132#1;__copy_from_user_#t~switch132#1 := true; [2021-11-22 21:42:00,685 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5799: assume 0bv64 != __copy_from_user_~tmp___1~2#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:42:00,685 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5799: assume !(0bv64 != __copy_from_user_~tmp___1~2#1);__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:42:00,686 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5799-1: assume 0bv64 != __copy_from_user_~tmp___1~2#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:42:00,686 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5799-1: assume !(0bv64 != __copy_from_user_~tmp___1~2#1);__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:42:00,686 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5807: assume __copy_from_user_#t~switch132#1;assume { :begin_inline_copy_user_generic } true;copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset, copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset, copy_user_generic_#in~len#1 := __copy_from_user_~dst#1.base, __copy_from_user_~dst#1.offset, __copy_from_user_~src#1.base, __copy_from_user_~src#1.offset, __copy_from_user_~size#1;havoc copy_user_generic_#res#1;havoc copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset, copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset, copy_user_generic_~len#1, copy_user_generic_~ret~0#1;copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset := copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset;copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset := copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset;copy_user_generic_~len#1 := copy_user_generic_#in~len#1;havoc copy_user_generic_~ret~0#1;copy_user_generic_#res#1 := ~zero_extendFrom32To64(copy_user_generic_~ret~0#1); [2021-11-22 21:42:00,686 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5807: assume !__copy_from_user_#t~switch132#1; [2021-11-22 21:42:00,686 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5807-1: assume __copy_from_user_#t~switch132#1;assume { :begin_inline_copy_user_generic } true;copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset, copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset, copy_user_generic_#in~len#1 := __copy_from_user_~dst#1.base, __copy_from_user_~dst#1.offset, __copy_from_user_~src#1.base, __copy_from_user_~src#1.offset, __copy_from_user_~size#1;havoc copy_user_generic_#res#1;havoc copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset, copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset, copy_user_generic_~len#1, copy_user_generic_~ret~0#1;copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset := copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset;copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset := copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset;copy_user_generic_~len#1 := copy_user_generic_#in~len#1;havoc copy_user_generic_~ret~0#1;copy_user_generic_#res#1 := ~zero_extendFrom32To64(copy_user_generic_~ret~0#1); [2021-11-22 21:42:00,686 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5807-1: assume !__copy_from_user_#t~switch132#1; [2021-11-22 21:42:00,686 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1218: assume __copy_from_user_#t~switch132#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:42:00,686 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1219: assume !__copy_from_user_#t~switch132#1;__copy_from_user_#t~switch132#1 := __copy_from_user_#t~switch132#1 || 2bv32 == __copy_from_user_~size#1; [2021-11-22 21:42:00,686 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5825-2: havoc __copy_to_user_#t~switch137#1; [2021-11-22 21:42:00,686 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5825-3: havoc __copy_to_user_#t~switch137#1; [2021-11-22 21:42:00,687 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5825: havoc __copy_to_user_#t~switch137#1; [2021-11-22 21:42:00,687 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5825-1: havoc __copy_to_user_#t~switch137#1; [2021-11-22 21:42:00,687 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5830: assume __copy_to_user_#t~switch137#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:42:00,687 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5830: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := __copy_to_user_#t~switch137#1 || 4bv32 == __copy_to_user_~size#1; [2021-11-22 21:42:00,687 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5830-3: assume __copy_to_user_#t~switch137#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:42:00,687 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5830-3: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := __copy_to_user_#t~switch137#1 || 4bv32 == __copy_to_user_~size#1; [2021-11-22 21:42:00,687 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5830-1: assume __copy_to_user_#t~switch137#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:42:00,687 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5830-1: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := __copy_to_user_#t~switch137#1 || 4bv32 == __copy_to_user_~size#1; [2021-11-22 21:42:00,687 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5830-2: assume __copy_to_user_#t~switch137#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:42:00,688 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5830-2: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := __copy_to_user_#t~switch137#1 || 4bv32 == __copy_to_user_~size#1; [2021-11-22 21:42:00,688 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5834: assume __copy_to_user_#t~switch137#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:42:00,688 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5834: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := __copy_to_user_#t~switch137#1 || 8bv32 == __copy_to_user_~size#1; [2021-11-22 21:42:00,688 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5834-3: assume __copy_to_user_#t~switch137#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:42:00,688 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5834-3: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := __copy_to_user_#t~switch137#1 || 8bv32 == __copy_to_user_~size#1; [2021-11-22 21:42:00,688 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5834-1: assume __copy_to_user_#t~switch137#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:42:00,688 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5834-1: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := __copy_to_user_#t~switch137#1 || 8bv32 == __copy_to_user_~size#1; [2021-11-22 21:42:00,688 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5834-2: assume __copy_to_user_#t~switch137#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:42:00,688 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5834-2: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := __copy_to_user_#t~switch137#1 || 8bv32 == __copy_to_user_~size#1; [2021-11-22 21:42:00,689 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5838: assume __copy_to_user_#t~switch137#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:42:00,689 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5838: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := __copy_to_user_#t~switch137#1 || 10bv32 == __copy_to_user_~size#1; [2021-11-22 21:42:00,689 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5838-3: assume __copy_to_user_#t~switch137#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:42:00,689 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5838-3: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := __copy_to_user_#t~switch137#1 || 10bv32 == __copy_to_user_~size#1; [2021-11-22 21:42:00,689 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5838-1: assume __copy_to_user_#t~switch137#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:42:00,690 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5838-1: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := __copy_to_user_#t~switch137#1 || 10bv32 == __copy_to_user_~size#1; [2021-11-22 21:42:00,690 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5838-2: assume __copy_to_user_#t~switch137#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:42:00,690 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5838-2: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := __copy_to_user_#t~switch137#1 || 10bv32 == __copy_to_user_~size#1; [2021-11-22 21:42:00,690 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5842: assume __copy_to_user_#t~switch137#1;assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := ~sign_extendFrom32To64((if 0bv32 != __copy_to_user_~ret~2#1 then 1bv32 else 0bv32)), 0bv64;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-22 21:42:00,690 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5842: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := __copy_to_user_#t~switch137#1 || 16bv32 == __copy_to_user_~size#1; [2021-11-22 21:42:00,690 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5842-3: assume __copy_to_user_#t~switch137#1;assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := ~sign_extendFrom32To64((if 0bv32 != __copy_to_user_~ret~2#1 then 1bv32 else 0bv32)), 0bv64;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-22 21:42:00,690 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5842-3: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := __copy_to_user_#t~switch137#1 || 16bv32 == __copy_to_user_~size#1; [2021-11-22 21:42:00,690 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5842-1: assume __copy_to_user_#t~switch137#1;assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := ~sign_extendFrom32To64((if 0bv32 != __copy_to_user_~ret~2#1 then 1bv32 else 0bv32)), 0bv64;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-22 21:42:00,690 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5842-1: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := __copy_to_user_#t~switch137#1 || 16bv32 == __copy_to_user_~size#1; [2021-11-22 21:42:00,690 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5842-2: assume __copy_to_user_#t~switch137#1;assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := ~sign_extendFrom32To64((if 0bv32 != __copy_to_user_~ret~2#1 then 1bv32 else 0bv32)), 0bv64;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-22 21:42:00,691 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5842-2: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := __copy_to_user_#t~switch137#1 || 16bv32 == __copy_to_user_~size#1; [2021-11-22 21:42:00,691 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5846: assume 0bv64 != __copy_to_user_~tmp___0~6#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:42:00,691 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5846: assume !(0bv64 != __copy_to_user_~tmp___0~6#1);__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:42:00,691 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5846-3: assume 0bv64 != __copy_to_user_~tmp___0~6#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:42:00,691 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5846-3: assume !(0bv64 != __copy_to_user_~tmp___0~6#1);__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:42:00,691 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5846-1: assume 0bv64 != __copy_to_user_~tmp___0~6#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:42:00,691 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5846-1: assume !(0bv64 != __copy_to_user_~tmp___0~6#1);__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:42:00,691 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5846-2: assume 0bv64 != __copy_to_user_~tmp___0~6#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:42:00,692 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5846-2: assume !(0bv64 != __copy_to_user_~tmp___0~6#1);__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:42:00,692 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5854: assume __copy_to_user_#t~switch137#1;assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := ~sign_extendFrom32To64((if 0bv32 != __copy_to_user_~ret~2#1 then 1bv32 else 0bv32)), 0bv64;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-22 21:42:00,692 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5854: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := true; [2021-11-22 21:42:00,692 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5854-3: assume __copy_to_user_#t~switch137#1;assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := ~sign_extendFrom32To64((if 0bv32 != __copy_to_user_~ret~2#1 then 1bv32 else 0bv32)), 0bv64;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-22 21:42:00,692 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5854-3: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := true; [2021-11-22 21:42:00,692 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5854-1: assume __copy_to_user_#t~switch137#1;assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := ~sign_extendFrom32To64((if 0bv32 != __copy_to_user_~ret~2#1 then 1bv32 else 0bv32)), 0bv64;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-22 21:42:00,692 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5854-1: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := true; [2021-11-22 21:42:00,693 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5854-2: assume __copy_to_user_#t~switch137#1;assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := ~sign_extendFrom32To64((if 0bv32 != __copy_to_user_~ret~2#1 then 1bv32 else 0bv32)), 0bv64;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-22 21:42:00,693 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5854-2: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := true; [2021-11-22 21:42:00,693 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5858: assume 0bv64 != __copy_to_user_~tmp___1~3#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:42:00,693 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5858: assume !(0bv64 != __copy_to_user_~tmp___1~3#1);__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:42:00,693 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5858-3: assume 0bv64 != __copy_to_user_~tmp___1~3#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:42:00,693 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5858-3: assume !(0bv64 != __copy_to_user_~tmp___1~3#1);__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:42:00,693 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5858-1: assume 0bv64 != __copy_to_user_~tmp___1~3#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:42:00,693 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5858-1: assume !(0bv64 != __copy_to_user_~tmp___1~3#1);__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:42:00,693 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5858-2: assume 0bv64 != __copy_to_user_~tmp___1~3#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:42:00,694 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5858-2: assume !(0bv64 != __copy_to_user_~tmp___1~3#1);__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:42:00,694 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5866: assume __copy_to_user_#t~switch137#1;assume { :begin_inline_copy_user_generic } true;copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset, copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset, copy_user_generic_#in~len#1 := __copy_to_user_~dst#1.base, __copy_to_user_~dst#1.offset, __copy_to_user_~src#1.base, __copy_to_user_~src#1.offset, __copy_to_user_~size#1;havoc copy_user_generic_#res#1;havoc copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset, copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset, copy_user_generic_~len#1, copy_user_generic_~ret~0#1;copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset := copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset;copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset := copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset;copy_user_generic_~len#1 := copy_user_generic_#in~len#1;havoc copy_user_generic_~ret~0#1;copy_user_generic_#res#1 := ~zero_extendFrom32To64(copy_user_generic_~ret~0#1); [2021-11-22 21:42:00,694 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5866: assume !__copy_to_user_#t~switch137#1; [2021-11-22 21:42:00,694 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5866-3: assume __copy_to_user_#t~switch137#1;assume { :begin_inline_copy_user_generic } true;copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset, copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset, copy_user_generic_#in~len#1 := __copy_to_user_~dst#1.base, __copy_to_user_~dst#1.offset, __copy_to_user_~src#1.base, __copy_to_user_~src#1.offset, __copy_to_user_~size#1;havoc copy_user_generic_#res#1;havoc copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset, copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset, copy_user_generic_~len#1, copy_user_generic_~ret~0#1;copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset := copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset;copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset := copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset;copy_user_generic_~len#1 := copy_user_generic_#in~len#1;havoc copy_user_generic_~ret~0#1;copy_user_generic_#res#1 := ~zero_extendFrom32To64(copy_user_generic_~ret~0#1); [2021-11-22 21:42:00,694 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5866-3: assume !__copy_to_user_#t~switch137#1; [2021-11-22 21:42:00,694 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5866-1: assume __copy_to_user_#t~switch137#1;assume { :begin_inline_copy_user_generic } true;copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset, copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset, copy_user_generic_#in~len#1 := __copy_to_user_~dst#1.base, __copy_to_user_~dst#1.offset, __copy_to_user_~src#1.base, __copy_to_user_~src#1.offset, __copy_to_user_~size#1;havoc copy_user_generic_#res#1;havoc copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset, copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset, copy_user_generic_~len#1, copy_user_generic_~ret~0#1;copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset := copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset;copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset := copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset;copy_user_generic_~len#1 := copy_user_generic_#in~len#1;havoc copy_user_generic_~ret~0#1;copy_user_generic_#res#1 := ~zero_extendFrom32To64(copy_user_generic_~ret~0#1); [2021-11-22 21:42:00,694 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5866-1: assume !__copy_to_user_#t~switch137#1; [2021-11-22 21:42:00,695 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5866-2: assume __copy_to_user_#t~switch137#1;assume { :begin_inline_copy_user_generic } true;copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset, copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset, copy_user_generic_#in~len#1 := __copy_to_user_~dst#1.base, __copy_to_user_~dst#1.offset, __copy_to_user_~src#1.base, __copy_to_user_~src#1.offset, __copy_to_user_~size#1;havoc copy_user_generic_#res#1;havoc copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset, copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset, copy_user_generic_~len#1, copy_user_generic_~ret~0#1;copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset := copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset;copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset := copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset;copy_user_generic_~len#1 := copy_user_generic_#in~len#1;havoc copy_user_generic_~ret~0#1;copy_user_generic_#res#1 := ~zero_extendFrom32To64(copy_user_generic_~ret~0#1); [2021-11-22 21:42:00,695 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5866-2: assume !__copy_to_user_#t~switch137#1; [2021-11-22 21:42:00,695 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##164: assume !__copy_from_user_#t~switch132#1;__copy_from_user_#t~switch132#1 := __copy_from_user_#t~switch132#1 || 2bv32 == __copy_from_user_~size#1; [2021-11-22 21:42:00,695 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##163: assume __copy_from_user_#t~switch132#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:42:00,696 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1876: assume __copy_to_user_#t~switch137#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:42:00,696 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1877: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := __copy_to_user_#t~switch137#1 || 2bv32 == __copy_to_user_~size#1; [2021-11-22 21:42:00,696 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1811: assume __copy_to_user_#t~switch137#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:42:00,696 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1812: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := __copy_to_user_#t~switch137#1 || 2bv32 == __copy_to_user_~size#1; [2021-11-22 21:42:00,696 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##757: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := __copy_to_user_#t~switch137#1 || 2bv32 == __copy_to_user_~size#1; [2021-11-22 21:42:00,696 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##756: assume __copy_to_user_#t~switch137#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:42:00,696 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5701-3: __copy_to_user_#t~ret140#1 := copy_user_generic_#res#1;assume { :end_inline_copy_user_generic } true;__copy_to_user_~tmp___2~4#1 := __copy_to_user_#t~ret140#1;havoc __copy_to_user_#t~ret140#1;__copy_to_user_#res#1 := __copy_to_user_~tmp___2~4#1[32:0]; [2021-11-22 21:42:00,696 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5701-1: __copy_from_user_#t~ret135#1 := copy_user_generic_#res#1;assume { :end_inline_copy_user_generic } true;__copy_from_user_~tmp___2~3#1 := __copy_from_user_#t~ret135#1;havoc __copy_from_user_#t~ret135#1;__copy_from_user_#res#1 := __copy_from_user_~tmp___2~3#1[32:0]; [2021-11-22 21:42:00,697 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5701-7: __copy_from_user_#t~ret135#1 := copy_user_generic_#res#1;assume { :end_inline_copy_user_generic } true;__copy_from_user_~tmp___2~3#1 := __copy_from_user_#t~ret135#1;havoc __copy_from_user_#t~ret135#1;__copy_from_user_#res#1 := __copy_from_user_~tmp___2~3#1[32:0]; [2021-11-22 21:42:00,697 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5701-5: __copy_to_user_#t~ret140#1 := copy_user_generic_#res#1;assume { :end_inline_copy_user_generic } true;__copy_to_user_~tmp___2~4#1 := __copy_to_user_#t~ret140#1;havoc __copy_to_user_#t~ret140#1;__copy_to_user_#res#1 := __copy_to_user_~tmp___2~4#1[32:0]; [2021-11-22 21:42:00,697 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5701-11: __copy_to_user_#t~ret140#1 := copy_user_generic_#res#1;assume { :end_inline_copy_user_generic } true;__copy_to_user_~tmp___2~4#1 := __copy_to_user_#t~ret140#1;havoc __copy_to_user_#t~ret140#1;__copy_to_user_#res#1 := __copy_to_user_~tmp___2~4#1[32:0]; [2021-11-22 21:42:00,697 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5701-9: __copy_to_user_#t~ret140#1 := copy_user_generic_#res#1;assume { :end_inline_copy_user_generic } true;__copy_to_user_~tmp___2~4#1 := __copy_to_user_#t~ret140#1;havoc __copy_to_user_#t~ret140#1;__copy_to_user_#res#1 := __copy_to_user_~tmp___2~4#1[32:0]; [2021-11-22 21:42:00,697 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L10999-19: __copy_from_user_#t~ret133#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;__copy_from_user_~tmp___0~5#1 := __copy_from_user_#t~ret133#1;havoc __copy_from_user_#t~ret133#1; [2021-11-22 21:42:00,697 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L10999-20: __copy_from_user_#t~ret134#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;__copy_from_user_~tmp___1~2#1 := __copy_from_user_#t~ret134#1;havoc __copy_from_user_#t~ret134#1; [2021-11-22 21:42:00,697 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L10999-85: __copy_to_user_#t~ret139#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;__copy_to_user_~tmp___1~3#1 := __copy_to_user_#t~ret139#1;havoc __copy_to_user_#t~ret139#1; [2021-11-22 21:42:00,698 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L10999-84: __copy_to_user_#t~ret138#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;__copy_to_user_~tmp___0~6#1 := __copy_to_user_#t~ret138#1;havoc __copy_to_user_#t~ret138#1; [2021-11-22 21:42:00,698 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L10999-79: __copy_to_user_#t~ret139#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;__copy_to_user_~tmp___1~3#1 := __copy_to_user_#t~ret139#1;havoc __copy_to_user_#t~ret139#1; [2021-11-22 21:42:00,698 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L10999-78: __copy_to_user_#t~ret138#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;__copy_to_user_~tmp___0~6#1 := __copy_to_user_#t~ret138#1;havoc __copy_to_user_#t~ret138#1; [2021-11-22 21:42:00,698 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L10999-121: __copy_from_user_#t~ret134#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;__copy_from_user_~tmp___1~2#1 := __copy_from_user_#t~ret134#1;havoc __copy_from_user_#t~ret134#1; [2021-11-22 21:42:00,698 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L10999-120: __copy_from_user_#t~ret133#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;__copy_from_user_~tmp___0~5#1 := __copy_from_user_#t~ret133#1;havoc __copy_from_user_#t~ret133#1; [2021-11-22 21:42:00,698 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L10999-179: __copy_to_user_#t~ret138#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;__copy_to_user_~tmp___0~6#1 := __copy_to_user_#t~ret138#1;havoc __copy_to_user_#t~ret138#1; [2021-11-22 21:42:00,698 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L10999-180: __copy_to_user_#t~ret139#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;__copy_to_user_~tmp___1~3#1 := __copy_to_user_#t~ret139#1;havoc __copy_to_user_#t~ret139#1; [2021-11-22 21:42:00,698 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L10999-186: __copy_to_user_#t~ret139#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;__copy_to_user_~tmp___1~3#1 := __copy_to_user_#t~ret139#1;havoc __copy_to_user_#t~ret139#1; [2021-11-22 21:42:00,699 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L10999-185: __copy_to_user_#t~ret138#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;__copy_to_user_~tmp___0~6#1 := __copy_to_user_#t~ret138#1;havoc __copy_to_user_#t~ret138#1; [2021-11-22 21:42:00,699 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##822: assume !__copy_to_user_#t~switch137#1;__copy_to_user_#t~switch137#1 := __copy_to_user_#t~switch137#1 || 2bv32 == __copy_to_user_~size#1; [2021-11-22 21:42:00,699 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##821: assume __copy_to_user_#t~switch137#1;__copy_to_user_#res#1 := __copy_to_user_~ret~2#1; [2021-11-22 21:42:00,699 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5760-1: havoc __copy_from_user_#t~switch132#1; [2021-11-22 21:42:00,699 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5760: havoc __copy_from_user_#t~switch132#1; [2021-11-22 21:42:00,699 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5766: assume __copy_from_user_#t~switch132#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:42:00,699 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5766: assume !__copy_from_user_#t~switch132#1;__copy_from_user_#t~switch132#1 := __copy_from_user_#t~switch132#1 || 4bv32 == __copy_from_user_~size#1; [2021-11-22 21:42:00,699 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5766-1: assume __copy_from_user_#t~switch132#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:42:00,700 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5766-1: assume !__copy_from_user_#t~switch132#1;__copy_from_user_#t~switch132#1 := __copy_from_user_#t~switch132#1 || 4bv32 == __copy_from_user_~size#1; [2021-11-22 21:42:00,700 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5771: assume __copy_from_user_#t~switch132#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:42:00,700 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5771: assume !__copy_from_user_#t~switch132#1;__copy_from_user_#t~switch132#1 := __copy_from_user_#t~switch132#1 || 8bv32 == __copy_from_user_~size#1; [2021-11-22 21:42:00,700 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5771-1: assume __copy_from_user_#t~switch132#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:42:00,700 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5771-1: assume !__copy_from_user_#t~switch132#1;__copy_from_user_#t~switch132#1 := __copy_from_user_#t~switch132#1 || 8bv32 == __copy_from_user_~size#1; [2021-11-22 21:42:00,700 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5776-1: assume __copy_from_user_#t~switch132#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:42:00,700 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5776-1: assume !__copy_from_user_#t~switch132#1;__copy_from_user_#t~switch132#1 := __copy_from_user_#t~switch132#1 || 10bv32 == __copy_from_user_~size#1; [2021-11-22 21:42:00,700 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5776: assume __copy_from_user_#t~switch132#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:42:00,700 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5776: assume !__copy_from_user_#t~switch132#1;__copy_from_user_#t~switch132#1 := __copy_from_user_#t~switch132#1 || 10bv32 == __copy_from_user_~size#1; [2021-11-22 21:42:00,701 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5781: assume __copy_from_user_#t~switch132#1;assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := ~sign_extendFrom32To64((if 0bv32 != __copy_from_user_~ret~1#1 then 1bv32 else 0bv32)), 0bv64;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-22 21:42:00,701 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5781: assume !__copy_from_user_#t~switch132#1;__copy_from_user_#t~switch132#1 := __copy_from_user_#t~switch132#1 || 16bv32 == __copy_from_user_~size#1; [2021-11-22 21:42:00,701 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5781-1: assume __copy_from_user_#t~switch132#1;assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := ~sign_extendFrom32To64((if 0bv32 != __copy_from_user_~ret~1#1 then 1bv32 else 0bv32)), 0bv64;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-22 21:42:00,701 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5781-1: assume !__copy_from_user_#t~switch132#1;__copy_from_user_#t~switch132#1 := __copy_from_user_#t~switch132#1 || 16bv32 == __copy_from_user_~size#1; [2021-11-22 21:42:33,439 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5786: assume 0bv64 != __copy_from_user_~tmp___0~5#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:42:33,440 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5786: assume !(0bv64 != __copy_from_user_~tmp___0~5#1);__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:42:33,440 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5794: assume __copy_from_user_#t~switch132#1;assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := ~sign_extendFrom32To64((if 0bv32 != __copy_from_user_~ret~1#1 then 1bv32 else 0bv32)), 0bv64;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-22 21:42:33,440 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5794: assume !__copy_from_user_#t~switch132#1;__copy_from_user_#t~switch132#1 := true; [2021-11-22 21:42:33,440 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5799: assume 0bv64 != __copy_from_user_~tmp___1~2#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:42:33,440 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5799: assume !(0bv64 != __copy_from_user_~tmp___1~2#1);__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:42:33,440 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5807: assume __copy_from_user_#t~switch132#1;assume { :begin_inline_copy_user_generic } true;copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset, copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset, copy_user_generic_#in~len#1 := __copy_from_user_~dst#1.base, __copy_from_user_~dst#1.offset, __copy_from_user_~src#1.base, __copy_from_user_~src#1.offset, __copy_from_user_~size#1;havoc copy_user_generic_#res#1;havoc copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset, copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset, copy_user_generic_~len#1, copy_user_generic_~ret~0#1;copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset := copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset;copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset := copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset;copy_user_generic_~len#1 := copy_user_generic_#in~len#1;havoc copy_user_generic_~ret~0#1;copy_user_generic_#res#1 := ~zero_extendFrom32To64(copy_user_generic_~ret~0#1); [2021-11-22 21:42:33,440 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5807: assume !__copy_from_user_#t~switch132#1; [2021-11-22 21:42:33,441 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##362: assume !__copy_from_user_#t~switch132#1;__copy_from_user_#t~switch132#1 := __copy_from_user_#t~switch132#1 || 2bv32 == __copy_from_user_~size#1; [2021-11-22 21:42:33,441 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##361: assume __copy_from_user_#t~switch132#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:42:33,441 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5701-1: __copy_from_user_#t~ret135#1 := copy_user_generic_#res#1;assume { :end_inline_copy_user_generic } true;__copy_from_user_~tmp___2~3#1 := __copy_from_user_#t~ret135#1;havoc __copy_from_user_#t~ret135#1;__copy_from_user_#res#1 := __copy_from_user_~tmp___2~3#1[32:0]; [2021-11-22 21:42:33,441 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L10999-29: __copy_from_user_#t~ret133#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;__copy_from_user_~tmp___0~5#1 := __copy_from_user_#t~ret133#1;havoc __copy_from_user_#t~ret133#1; [2021-11-22 21:42:33,441 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L10999-30: __copy_from_user_#t~ret134#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;__copy_from_user_~tmp___1~2#1 := __copy_from_user_#t~ret134#1;havoc __copy_from_user_#t~ret134#1; [2021-11-22 21:42:33,441 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5760: havoc __copy_from_user_#t~switch132#1; [2021-11-22 21:42:33,441 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5766: assume __copy_from_user_#t~switch132#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:42:33,441 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5766: assume !__copy_from_user_#t~switch132#1;__copy_from_user_#t~switch132#1 := __copy_from_user_#t~switch132#1 || 4bv32 == __copy_from_user_~size#1; [2021-11-22 21:42:33,441 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5771: assume __copy_from_user_#t~switch132#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:42:33,441 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5771: assume !__copy_from_user_#t~switch132#1;__copy_from_user_#t~switch132#1 := __copy_from_user_#t~switch132#1 || 8bv32 == __copy_from_user_~size#1; [2021-11-22 21:42:33,441 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5776: assume __copy_from_user_#t~switch132#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:42:33,441 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5776: assume !__copy_from_user_#t~switch132#1;__copy_from_user_#t~switch132#1 := __copy_from_user_#t~switch132#1 || 10bv32 == __copy_from_user_~size#1; [2021-11-22 21:42:33,442 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5781: assume __copy_from_user_#t~switch132#1;assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := ~sign_extendFrom32To64((if 0bv32 != __copy_from_user_~ret~1#1 then 1bv32 else 0bv32)), 0bv64;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-22 21:42:33,443 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L5781: assume !__copy_from_user_#t~switch132#1;__copy_from_user_#t~switch132#1 := __copy_from_user_#t~switch132#1 || 16bv32 == __copy_from_user_~size#1; [2021-11-22 21:44:12,204 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 21:44:12,237 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 21:44:12,237 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-22 21:44:12,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:44:12 BoogieIcfgContainer [2021-11-22 21:44:12,243 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 21:44:12,244 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-22 21:44:12,245 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-22 21:44:12,246 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-22 21:44:12,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:41:01" (1/3) ... [2021-11-22 21:44:12,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5db5e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:44:12, skipping insertion in model container [2021-11-22 21:44:12,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:04" (2/3) ... [2021-11-22 21:44:12,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5db5e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:44:12, skipping insertion in model container [2021-11-22 21:44:12,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:44:12" (3/3) ... [2021-11-22 21:44:12,248 INFO L111 eAbstractionObserver]: Analyzing ICFG main1_drivers-vhost-vhost_net-ko--32_7a--linux-3.7.3.i [2021-11-22 21:44:12,251 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-22 21:44:12,251 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 78 error locations. [2021-11-22 21:44:12,300 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-22 21:44:12,305 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-22 21:44:12,305 INFO L340 AbstractCegarLoop]: Starting to check reachability of 78 error locations. [2021-11-22 21:44:12,389 INFO L276 IsEmpty]: Start isEmpty. Operand has 9232 states, 9130 states have (on average 1.368565169769989) internal successors, (12495), 9212 states have internal predecessors, (12495), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2021-11-22 21:44:12,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-22 21:44:12,392 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:44:12,392 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:44:12,393 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 75 more)] === [2021-11-22 21:44:12,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:44:12,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1545440292, now seen corresponding path program 1 times [2021-11-22 21:44:12,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 21:44:12,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1774856081] [2021-11-22 21:44:12,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:44:12,408 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 21:44:12,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 21:44:12,410 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 21:44:12,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-22 21:44:13,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:44:13,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-22 21:44:13,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 21:44:13,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:44:13,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 21:44:13,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:44:13,414 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 21:44:13,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1774856081] [2021-11-22 21:44:13,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1774856081] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 21:44:13,415 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:44:13,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-22 21:44:13,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317474425] [2021-11-22 21:44:13,417 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 21:44:13,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 21:44:13,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 21:44:13,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 21:44:13,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:44:13,452 INFO L87 Difference]: Start difference. First operand has 9232 states, 9130 states have (on average 1.368565169769989) internal successors, (12495), 9212 states have internal predecessors, (12495), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:44:13,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:44:13,992 INFO L93 Difference]: Finished difference Result 18374 states and 24973 transitions. [2021-11-22 21:44:13,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 21:44:13,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-11-22 21:44:13,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:44:14,036 INFO L225 Difference]: With dead ends: 18374 [2021-11-22 21:44:14,037 INFO L226 Difference]: Without dead ends: 9062 [2021-11-22 21:44:14,064 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:44:14,067 INFO L933 BasicCegarLoop]: 12327 mSDtfsCounter, 12318 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12318 SdHoareTripleChecker+Valid, 12327 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 21:44:14,067 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12318 Valid, 12327 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 21:44:14,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9062 states. [2021-11-22 21:44:14,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9062 to 9062. [2021-11-22 21:44:14,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9062 states, 8962 states have (on average 1.3525998661013168) internal successors, (12122), 9042 states have internal predecessors, (12122), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2021-11-22 21:44:14,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9062 states to 9062 states and 12152 transitions. [2021-11-22 21:44:14,350 INFO L78 Accepts]: Start accepts. Automaton has 9062 states and 12152 transitions. Word has length 12 [2021-11-22 21:44:14,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:44:14,351 INFO L470 AbstractCegarLoop]: Abstraction has 9062 states and 12152 transitions. [2021-11-22 21:44:14,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:44:14,351 INFO L276 IsEmpty]: Start isEmpty. Operand 9062 states and 12152 transitions. [2021-11-22 21:44:14,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-22 21:44:14,352 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:44:14,352 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:44:14,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-22 21:44:14,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-22 21:44:14,567 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 75 more)] === [2021-11-22 21:44:14,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:44:14,568 INFO L85 PathProgramCache]: Analyzing trace with hash 664035932, now seen corresponding path program 1 times [2021-11-22 21:44:14,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 21:44:14,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [319167813] [2021-11-22 21:44:14,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:44:14,569 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 21:44:14,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 21:44:14,570 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 21:44:14,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-22 21:44:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:44:15,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-22 21:44:15,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 21:44:15,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:44:15,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 21:44:15,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:44:15,564 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 21:44:15,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [319167813] [2021-11-22 21:44:15,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [319167813] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 21:44:15,565 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:44:15,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-22 21:44:15,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721350382] [2021-11-22 21:44:15,566 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 21:44:15,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 21:44:15,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 21:44:15,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 21:44:15,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:44:15,567 INFO L87 Difference]: Start difference. First operand 9062 states and 12152 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:44:15,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:44:15,827 INFO L93 Difference]: Finished difference Result 9062 states and 12152 transitions. [2021-11-22 21:44:15,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 21:44:15,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-22 21:44:15,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:44:15,857 INFO L225 Difference]: With dead ends: 9062 [2021-11-22 21:44:15,857 INFO L226 Difference]: Without dead ends: 9060 [2021-11-22 21:44:15,863 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:44:15,864 INFO L933 BasicCegarLoop]: 12149 mSDtfsCounter, 12139 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12139 SdHoareTripleChecker+Valid, 12149 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 21:44:15,864 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12139 Valid, 12149 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 21:44:15,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9060 states. [2021-11-22 21:44:16,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9060 to 9060. [2021-11-22 21:44:16,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9060 states, 8961 states have (on average 1.3525276196853029) internal successors, (12120), 9040 states have internal predecessors, (12120), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2021-11-22 21:44:16,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9060 states to 9060 states and 12150 transitions. [2021-11-22 21:44:16,098 INFO L78 Accepts]: Start accepts. Automaton has 9060 states and 12150 transitions. Word has length 13 [2021-11-22 21:44:16,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:44:16,098 INFO L470 AbstractCegarLoop]: Abstraction has 9060 states and 12150 transitions. [2021-11-22 21:44:16,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:44:16,099 INFO L276 IsEmpty]: Start isEmpty. Operand 9060 states and 12150 transitions. [2021-11-22 21:44:16,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-22 21:44:16,099 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:44:16,099 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:44:16,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-11-22 21:44:16,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-22 21:44:16,310 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 75 more)] === [2021-11-22 21:44:16,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:44:16,310 INFO L85 PathProgramCache]: Analyzing trace with hash -889695441, now seen corresponding path program 1 times [2021-11-22 21:44:16,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 21:44:16,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1043881789] [2021-11-22 21:44:16,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:44:16,312 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 21:44:16,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 21:44:16,313 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 21:44:16,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-22 21:44:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:44:16,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-22 21:44:16,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 21:44:17,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:44:17,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 21:44:17,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:44:17,247 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 21:44:17,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1043881789] [2021-11-22 21:44:17,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1043881789] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 21:44:17,247 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:44:17,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-22 21:44:17,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929001638] [2021-11-22 21:44:17,247 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 21:44:17,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 21:44:17,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 21:44:17,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 21:44:17,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:44:17,249 INFO L87 Difference]: Start difference. First operand 9060 states and 12150 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:44:17,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:44:17,537 INFO L93 Difference]: Finished difference Result 9060 states and 12150 transitions. [2021-11-22 21:44:17,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 21:44:17,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-11-22 21:44:17,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:44:17,579 INFO L225 Difference]: With dead ends: 9060 [2021-11-22 21:44:17,579 INFO L226 Difference]: Without dead ends: 9058 [2021-11-22 21:44:17,585 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:44:17,588 INFO L933 BasicCegarLoop]: 12147 mSDtfsCounter, 12136 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12136 SdHoareTripleChecker+Valid, 12147 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 21:44:17,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12136 Valid, 12147 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 21:44:17,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9058 states. [2021-11-22 21:44:17,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9058 to 9058. [2021-11-22 21:44:17,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9058 states, 8960 states have (on average 1.3524553571428573) internal successors, (12118), 9038 states have internal predecessors, (12118), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2021-11-22 21:44:17,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9058 states to 9058 states and 12148 transitions. [2021-11-22 21:44:17,954 INFO L78 Accepts]: Start accepts. Automaton has 9058 states and 12148 transitions. Word has length 14 [2021-11-22 21:44:17,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:44:17,955 INFO L470 AbstractCegarLoop]: Abstraction has 9058 states and 12148 transitions. [2021-11-22 21:44:17,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:44:17,955 INFO L276 IsEmpty]: Start isEmpty. Operand 9058 states and 12148 transitions. [2021-11-22 21:44:17,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-22 21:44:17,960 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:44:17,960 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:44:17,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-22 21:44:18,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-22 21:44:18,171 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 75 more)] === [2021-11-22 21:44:18,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:44:18,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1810727737, now seen corresponding path program 1 times [2021-11-22 21:44:18,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 21:44:18,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1985773598] [2021-11-22 21:44:18,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:44:18,173 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 21:44:18,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 21:44:18,174 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 21:44:18,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-22 21:44:18,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:44:18,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-22 21:44:18,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 21:44:18,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:44:18,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 21:44:19,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:44:19,106 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 21:44:19,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1985773598] [2021-11-22 21:44:19,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1985773598] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 21:44:19,107 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:44:19,107 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-22 21:44:19,107 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643751019] [2021-11-22 21:44:19,107 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 21:44:19,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 21:44:19,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 21:44:19,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 21:44:19,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:44:19,108 INFO L87 Difference]: Start difference. First operand 9058 states and 12148 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:44:20,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:44:20,728 INFO L93 Difference]: Finished difference Result 18957 states and 25369 transitions. [2021-11-22 21:44:20,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 21:44:20,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-22 21:44:20,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:44:20,752 INFO L225 Difference]: With dead ends: 18957 [2021-11-22 21:44:20,752 INFO L226 Difference]: Without dead ends: 9900 [2021-11-22 21:44:20,772 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:44:20,773 INFO L933 BasicCegarLoop]: 12983 mSDtfsCounter, 3760 mSDsluCounter, 9197 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3760 SdHoareTripleChecker+Valid, 22180 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-22 21:44:20,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3760 Valid, 22180 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-22 21:44:20,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9900 states. [2021-11-22 21:44:21,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9900 to 9878. [2021-11-22 21:44:21,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9878 states, 9779 states have (on average 1.3385826771653544) internal successors, (13090), 9844 states have internal predecessors, (13090), 23 states have call successors, (23), 15 states have call predecessors, (23), 16 states have return successors, (33), 21 states have call predecessors, (33), 23 states have call successors, (33) [2021-11-22 21:44:21,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9878 states to 9878 states and 13146 transitions. [2021-11-22 21:44:21,049 INFO L78 Accepts]: Start accepts. Automaton has 9878 states and 13146 transitions. Word has length 15 [2021-11-22 21:44:21,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:44:21,050 INFO L470 AbstractCegarLoop]: Abstraction has 9878 states and 13146 transitions. [2021-11-22 21:44:21,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:44:21,051 INFO L276 IsEmpty]: Start isEmpty. Operand 9878 states and 13146 transitions. [2021-11-22 21:44:21,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-22 21:44:21,055 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:44:21,055 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:44:21,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-22 21:44:21,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-22 21:44:21,267 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 75 more)] === [2021-11-22 21:44:21,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:44:21,267 INFO L85 PathProgramCache]: Analyzing trace with hash 98043801, now seen corresponding path program 1 times [2021-11-22 21:44:21,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 21:44:21,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [727334502] [2021-11-22 21:44:21,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:44:21,269 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 21:44:21,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 21:44:21,269 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 21:44:21,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-22 21:44:21,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:44:21,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-22 21:44:21,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 21:44:22,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:44:22,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 21:44:22,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:44:22,475 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 21:44:22,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [727334502] [2021-11-22 21:44:22,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [727334502] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 21:44:22,475 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:44:22,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-22 21:44:22,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268461112] [2021-11-22 21:44:22,475 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 21:44:22,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 21:44:22,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 21:44:22,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 21:44:22,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-22 21:44:22,476 INFO L87 Difference]: Start difference. First operand 9878 states and 13146 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:44:23,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:44:23,273 INFO L93 Difference]: Finished difference Result 30768 states and 40549 transitions. [2021-11-22 21:44:23,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 21:44:23,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-22 21:44:23,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:44:23,318 INFO L225 Difference]: With dead ends: 30768 [2021-11-22 21:44:23,318 INFO L226 Difference]: Without dead ends: 20900 [2021-11-22 21:44:23,348 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-22 21:44:23,349 INFO L933 BasicCegarLoop]: 12422 mSDtfsCounter, 12579 mSDsluCounter, 30010 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12587 SdHoareTripleChecker+Valid, 42432 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 21:44:23,349 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12587 Valid, 42432 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 21:44:23,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20900 states. [2021-11-22 21:44:23,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20900 to 12860. [2021-11-22 21:44:23,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12860 states, 12761 states have (on average 1.3227019826032442) internal successors, (16879), 12826 states have internal predecessors, (16879), 23 states have call successors, (23), 15 states have call predecessors, (23), 16 states have return successors, (33), 21 states have call predecessors, (33), 23 states have call successors, (33) [2021-11-22 21:44:23,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12860 states to 12860 states and 16935 transitions. [2021-11-22 21:44:23,773 INFO L78 Accepts]: Start accepts. Automaton has 12860 states and 16935 transitions. Word has length 28 [2021-11-22 21:44:23,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:44:23,774 INFO L470 AbstractCegarLoop]: Abstraction has 12860 states and 16935 transitions. [2021-11-22 21:44:23,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:44:23,774 INFO L276 IsEmpty]: Start isEmpty. Operand 12860 states and 16935 transitions. [2021-11-22 21:44:23,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-22 21:44:23,777 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:44:23,777 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:44:23,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-22 21:44:23,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-22 21:44:23,990 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 75 more)] === [2021-11-22 21:44:23,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:44:23,991 INFO L85 PathProgramCache]: Analyzing trace with hash 266097323, now seen corresponding path program 1 times [2021-11-22 21:44:23,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 21:44:23,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1877378767] [2021-11-22 21:44:23,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:44:23,992 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 21:44:23,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 21:44:23,993 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 21:44:23,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-22 21:44:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:44:24,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-22 21:44:24,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 21:44:24,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:44:24,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 21:44:24,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:44:24,807 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 21:44:24,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1877378767] [2021-11-22 21:44:24,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1877378767] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 21:44:24,808 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:44:24,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-22 21:44:24,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674256473] [2021-11-22 21:44:24,808 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 21:44:24,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 21:44:24,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 21:44:24,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 21:44:24,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:44:24,809 INFO L87 Difference]: Start difference. First operand 12860 states and 16935 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:44:28,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:44:28,961 INFO L93 Difference]: Finished difference Result 25846 states and 33995 transitions. [2021-11-22 21:44:28,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 21:44:28,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-11-22 21:44:28,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:44:28,992 INFO L225 Difference]: With dead ends: 25846 [2021-11-22 21:44:28,993 INFO L226 Difference]: Without dead ends: 12996 [2021-11-22 21:44:29,020 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:44:29,021 INFO L933 BasicCegarLoop]: 11791 mSDtfsCounter, 0 mSDsluCounter, 11377 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 418 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23168 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 418 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2021-11-22 21:44:29,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 23168 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [418 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2021-11-22 21:44:29,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12996 states. [2021-11-22 21:44:29,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12996 to 12860. [2021-11-22 21:44:29,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12860 states, 12761 states have (on average 1.2907295666483818) internal successors, (16471), 12826 states have internal predecessors, (16471), 23 states have call successors, (23), 15 states have call predecessors, (23), 16 states have return successors, (33), 21 states have call predecessors, (33), 23 states have call successors, (33) [2021-11-22 21:44:29,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12860 states to 12860 states and 16527 transitions. [2021-11-22 21:44:29,388 INFO L78 Accepts]: Start accepts. Automaton has 12860 states and 16527 transitions. Word has length 34 [2021-11-22 21:44:29,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:44:29,389 INFO L470 AbstractCegarLoop]: Abstraction has 12860 states and 16527 transitions. [2021-11-22 21:44:29,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:44:29,389 INFO L276 IsEmpty]: Start isEmpty. Operand 12860 states and 16527 transitions. [2021-11-22 21:44:29,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-22 21:44:29,390 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:44:29,390 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:44:29,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-22 21:44:29,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-22 21:44:29,607 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 75 more)] === [2021-11-22 21:44:29,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:44:29,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1672528523, now seen corresponding path program 1 times [2021-11-22 21:44:29,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 21:44:29,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1842271607] [2021-11-22 21:44:29,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:44:29,609 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 21:44:29,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 21:44:29,611 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 21:44:29,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-22 21:44:35,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 21:44:35,811 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-22 21:44:41,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 21:44:42,207 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-11-22 21:44:42,207 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-22 21:44:42,208 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION (77 of 78 remaining) [2021-11-22 21:44:42,217 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (76 of 78 remaining) [2021-11-22 21:44:42,217 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION (75 of 78 remaining) [2021-11-22 21:44:42,217 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (74 of 78 remaining) [2021-11-22 21:44:42,217 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~VOIDErr3ASSERT_VIOLATIONERROR_FUNCTION (73 of 78 remaining) [2021-11-22 21:44:42,217 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location handle_txErr0ASSERT_VIOLATIONERROR_FUNCTION (72 of 78 remaining) [2021-11-22 21:44:42,217 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location handle_txErr1ASSERT_VIOLATIONERROR_FUNCTION (71 of 78 remaining) [2021-11-22 21:44:42,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location handle_txErr2ASSERT_VIOLATIONERROR_FUNCTION (70 of 78 remaining) [2021-11-22 21:44:42,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location handle_txErr3ASSERT_VIOLATIONERROR_FUNCTION (69 of 78 remaining) [2021-11-22 21:44:42,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (68 of 78 remaining) [2021-11-22 21:44:42,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (67 of 78 remaining) [2021-11-22 21:44:42,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (66 of 78 remaining) [2021-11-22 21:44:42,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (65 of 78 remaining) [2021-11-22 21:44:42,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (64 of 78 remaining) [2021-11-22 21:44:42,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (63 of 78 remaining) [2021-11-22 21:44:42,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (62 of 78 remaining) [2021-11-22 21:44:42,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (61 of 78 remaining) [2021-11-22 21:44:42,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (60 of 78 remaining) [2021-11-22 21:44:42,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (59 of 78 remaining) [2021-11-22 21:44:42,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (58 of 78 remaining) [2021-11-22 21:44:42,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (57 of 78 remaining) [2021-11-22 21:44:42,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (56 of 78 remaining) [2021-11-22 21:44:42,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (55 of 78 remaining) [2021-11-22 21:44:42,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (54 of 78 remaining) [2021-11-22 21:44:42,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (53 of 78 remaining) [2021-11-22 21:44:42,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (52 of 78 remaining) [2021-11-22 21:44:42,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (51 of 78 remaining) [2021-11-22 21:44:42,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION (50 of 78 remaining) [2021-11-22 21:44:42,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION (49 of 78 remaining) [2021-11-22 21:44:42,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION (48 of 78 remaining) [2021-11-22 21:44:42,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION (47 of 78 remaining) [2021-11-22 21:44:42,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION (46 of 78 remaining) [2021-11-22 21:44:42,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION (45 of 78 remaining) [2021-11-22 21:44:42,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION (44 of 78 remaining) [2021-11-22 21:44:42,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION (43 of 78 remaining) [2021-11-22 21:44:42,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION (42 of 78 remaining) [2021-11-22 21:44:42,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION (41 of 78 remaining) [2021-11-22 21:44:42,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION (40 of 78 remaining) [2021-11-22 21:44:42,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION (39 of 78 remaining) [2021-11-22 21:44:42,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION (38 of 78 remaining) [2021-11-22 21:44:42,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION (37 of 78 remaining) [2021-11-22 21:44:42,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION (36 of 78 remaining) [2021-11-22 21:44:42,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION (35 of 78 remaining) [2021-11-22 21:44:42,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION (34 of 78 remaining) [2021-11-22 21:44:42,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION (33 of 78 remaining) [2021-11-22 21:44:42,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION (32 of 78 remaining) [2021-11-22 21:44:42,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION (31 of 78 remaining) [2021-11-22 21:44:42,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION (30 of 78 remaining) [2021-11-22 21:44:42,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION (29 of 78 remaining) [2021-11-22 21:44:42,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION (28 of 78 remaining) [2021-11-22 21:44:42,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION (27 of 78 remaining) [2021-11-22 21:44:42,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION (26 of 78 remaining) [2021-11-22 21:44:42,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION (25 of 78 remaining) [2021-11-22 21:44:42,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION (24 of 78 remaining) [2021-11-22 21:44:42,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION (23 of 78 remaining) [2021-11-22 21:44:42,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION (22 of 78 remaining) [2021-11-22 21:44:42,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION (21 of 78 remaining) [2021-11-22 21:44:42,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION (20 of 78 remaining) [2021-11-22 21:44:42,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION (19 of 78 remaining) [2021-11-22 21:44:42,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (18 of 78 remaining) [2021-11-22 21:44:42,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION (17 of 78 remaining) [2021-11-22 21:44:42,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION (16 of 78 remaining) [2021-11-22 21:44:42,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONERROR_FUNCTION (15 of 78 remaining) [2021-11-22 21:44:42,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONERROR_FUNCTION (14 of 78 remaining) [2021-11-22 21:44:42,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONERROR_FUNCTION (13 of 78 remaining) [2021-11-22 21:44:42,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONERROR_FUNCTION (12 of 78 remaining) [2021-11-22 21:44:42,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONERROR_FUNCTION (11 of 78 remaining) [2021-11-22 21:44:42,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONERROR_FUNCTION (10 of 78 remaining) [2021-11-22 21:44:42,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONERROR_FUNCTION (9 of 78 remaining) [2021-11-22 21:44:42,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONERROR_FUNCTION (8 of 78 remaining) [2021-11-22 21:44:42,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONERROR_FUNCTION (7 of 78 remaining) [2021-11-22 21:44:42,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONERROR_FUNCTION (6 of 78 remaining) [2021-11-22 21:44:42,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONERROR_FUNCTION (5 of 78 remaining) [2021-11-22 21:44:42,223 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONERROR_FUNCTION (4 of 78 remaining) [2021-11-22 21:44:42,223 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONERROR_FUNCTION (3 of 78 remaining) [2021-11-22 21:44:42,223 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONERROR_FUNCTION (2 of 78 remaining) [2021-11-22 21:44:42,223 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONERROR_FUNCTION (1 of 78 remaining) [2021-11-22 21:44:42,223 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONERROR_FUNCTION (0 of 78 remaining) [2021-11-22 21:44:42,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-22 21:44:42,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-22 21:44:42,438 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:44:42,440 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-22 21:44:42,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:44:42 BoogieIcfgContainer [2021-11-22 21:44:42,517 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-22 21:44:42,517 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-22 21:44:42,517 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-22 21:44:42,517 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-22 21:44:42,518 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:44:12" (3/4) ... [2021-11-22 21:44:42,520 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-22 21:44:42,520 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-22 21:44:42,520 INFO L158 Benchmark]: Toolchain (without parser) took 220875.75ms. Allocated memory was 65.0MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 43.4MB in the beginning and 793.7MB in the end (delta: -750.4MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2021-11-22 21:44:42,520 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 65.0MB. Free memory was 45.8MB in the beginning and 45.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-22 21:44:42,521 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2451.07ms. Allocated memory was 65.0MB in the beginning and 197.1MB in the end (delta: 132.1MB). Free memory was 43.2MB in the beginning and 107.9MB in the end (delta: -64.8MB). Peak memory consumption was 100.5MB. Max. memory is 16.1GB. [2021-11-22 21:44:42,521 INFO L158 Benchmark]: Boogie Procedure Inliner took 692.82ms. Allocated memory was 197.1MB in the beginning and 308.3MB in the end (delta: 111.1MB). Free memory was 107.9MB in the beginning and 151.3MB in the end (delta: -43.4MB). Peak memory consumption was 126.4MB. Max. memory is 16.1GB. [2021-11-22 21:44:42,521 INFO L158 Benchmark]: Boogie Preprocessor took 1199.85ms. Allocated memory was 308.3MB in the beginning and 924.8MB in the end (delta: 616.6MB). Free memory was 151.3MB in the beginning and 685.0MB in the end (delta: -533.7MB). Peak memory consumption was 111.1MB. Max. memory is 16.1GB. [2021-11-22 21:44:42,521 INFO L158 Benchmark]: RCFGBuilder took 186252.46ms. Allocated memory was 924.8MB in the beginning and 1.9GB in the end (delta: 952.1MB). Free memory was 685.0MB in the beginning and 1.1GB in the end (delta: -438.7MB). Peak memory consumption was 683.3MB. Max. memory is 16.1GB. [2021-11-22 21:44:42,522 INFO L158 Benchmark]: TraceAbstraction took 30272.16ms. Allocated memory is still 1.9GB. Free memory was 1.1GB in the beginning and 793.7MB in the end (delta: 330.0MB). Peak memory consumption was 332.1MB. Max. memory is 16.1GB. [2021-11-22 21:44:42,522 INFO L158 Benchmark]: Witness Printer took 2.74ms. Allocated memory is still 1.9GB. Free memory is still 793.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-22 21:44:42,523 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.10ms. Allocated memory is still 65.0MB. Free memory was 45.8MB in the beginning and 45.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2451.07ms. Allocated memory was 65.0MB in the beginning and 197.1MB in the end (delta: 132.1MB). Free memory was 43.2MB in the beginning and 107.9MB in the end (delta: -64.8MB). Peak memory consumption was 100.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 692.82ms. Allocated memory was 197.1MB in the beginning and 308.3MB in the end (delta: 111.1MB). Free memory was 107.9MB in the beginning and 151.3MB in the end (delta: -43.4MB). Peak memory consumption was 126.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 1199.85ms. Allocated memory was 308.3MB in the beginning and 924.8MB in the end (delta: 616.6MB). Free memory was 151.3MB in the beginning and 685.0MB in the end (delta: -533.7MB). Peak memory consumption was 111.1MB. Max. memory is 16.1GB. * RCFGBuilder took 186252.46ms. Allocated memory was 924.8MB in the beginning and 1.9GB in the end (delta: 952.1MB). Free memory was 685.0MB in the beginning and 1.1GB in the end (delta: -438.7MB). Peak memory consumption was 683.3MB. Max. memory is 16.1GB. * TraceAbstraction took 30272.16ms. Allocated memory is still 1.9GB. Free memory was 1.1GB in the beginning and 793.7MB in the end (delta: 330.0MB). Peak memory consumption was 332.1MB. Max. memory is 16.1GB. * Witness Printer took 2.74ms. Allocated memory is still 1.9GB. Free memory is still 793.7MB. There was no memory consumed. Max. memory is 16.1GB. * 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: 10992]: 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 10595. Possible FailurePath: [L5971] static unsigned int vhost_zcopy_mask ; [L9348] static int experimental_zcopytx ; [L10590-L10593] static struct file_operations const vhost_net_fops = {& __this_module, & noop_llseek, 0, 0, 0, 0, 0, 0, & vhost_net_ioctl, & vhost_net_compat_ioctl, 0, & vhost_net_open, 0, & vhost_net_release, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}; [L10594-L10595] static struct miscdevice vhost_net_misc = {238, "vhost-net", & vhost_net_fops, {0, 0}, 0, 0, 0, (unsigned short)0}; [L10620] int LDV_IN_INTERRUPT ; [L11002] static int ldv_mutex_cred_guard_mutex ; [L11109] static int ldv_mutex_lock ; [L11216] static int ldv_mutex_mtx ; [L11323] static int ldv_mutex_mutex ; VAL [__this_module={0:0}, experimental_zcopytx=0, LDV_IN_INTERRUPT=0, ldv_mutex_cred_guard_mutex=0, ldv_mutex_lock=0, ldv_mutex_mtx=0, ldv_mutex_mutex=0, vhost_net_fops={215:0}, vhost_net_misc={216:0}, vhost_zcopy_mask=0] [L10623] struct inode *var_group1 ; [L10624] struct file *var_group2 ; [L10625] unsigned int var_vhost_net_ioctl_27_p1 ; [L10626] unsigned long var_vhost_net_ioctl_27_p2 ; [L10627] unsigned int var_vhost_net_compat_ioctl_28_p1 ; [L10628] unsigned long var_vhost_net_compat_ioctl_28_p2 ; [L10629] int res_vhost_net_open_13 ; [L10630] int ldv_s_vhost_net_fops_file_operations ; [L10631] int tmp ; [L10632] int tmp___0 ; [L10633] int tmp___1 ; [L10635] ldv_s_vhost_net_fops_file_operations = 0 [L10636] LDV_IN_INTERRUPT = 1 [L10637] CALL ldv_initialize() [L11433] ldv_mutex_cred_guard_mutex = 1 [L11434] ldv_mutex_lock = 1 [L11435] ldv_mutex_mtx = 1 [L11436] ldv_mutex_mutex = 1 VAL [__this_module={0:0}, experimental_zcopytx=0, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=1, vhost_net_fops={215:0}, vhost_net_misc={216:0}, vhost_zcopy_mask=0] [L10637] RET ldv_initialize() [L10638] FCALL ldv_handler_precall() [L10639] CALL, EXPR vhost_net_init() [L10598] int tmp ; VAL [__this_module={0:0}, experimental_zcopytx=0, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=1, vhost_net_fops={215:0}, vhost_net_misc={216:0}, vhost_zcopy_mask=0] [L10600] COND FALSE !(experimental_zcopytx != 0) VAL [__this_module={0:0}, experimental_zcopytx=0, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=1, vhost_net_fops={215:0}, vhost_net_misc={216:0}, vhost_zcopy_mask=0] [L10604] CALL, EXPR misc_register(& vhost_net_misc) [L11595] return __VERIFIER_nondet_int(); [L10604] RET, EXPR misc_register(& vhost_net_misc) [L10604] tmp = misc_register(& vhost_net_misc) [L10605] return (tmp); VAL [\result=0, __this_module={0:0}, experimental_zcopytx=0, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=1, tmp=0, vhost_net_fops={215:0}, vhost_net_misc={216:0}, vhost_zcopy_mask=0] [L10639] RET, EXPR vhost_net_init() [L10639] tmp = vhost_net_init() [L10640] COND FALSE !(tmp != 0) VAL [__this_module={0:0}, experimental_zcopytx=0, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=1, ldv_s_vhost_net_fops_file_operations=0, tmp=0, vhost_net_fops={215:0}, vhost_net_misc={216:0}, vhost_zcopy_mask=0] [L10682] tmp___1 = __VERIFIER_nondet_int() [L10683] COND TRUE tmp___1 != 0 || ldv_s_vhost_net_fops_file_operations != 0 VAL [__this_module={0:0}, experimental_zcopytx=0, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=1, ldv_s_vhost_net_fops_file_operations=0, tmp=0, tmp___1=2147483648, vhost_net_fops={215:0}, vhost_net_misc={216:0}, vhost_zcopy_mask=0] [L10646] tmp___0 = __VERIFIER_nondet_int() [L10648] case 0: [L10661] case 1: [L10669] case 2: [L10670] FCALL ldv_handler_precall() [L10671] CALL vhost_net_ioctl(var_group2, var_vhost_net_ioctl_27_p1, var_vhost_net_ioctl_27_p2) [L10521] struct vhost_net *n ; [L10522] void *argp ; [L10523] u64 *featurep ; [L10524] struct vhost_vring_file backend ; [L10525] u64 features ; [L10526] int r ; [L10527] unsigned long tmp ; [L10528] long tmp___0 ; [L10529] int tmp___1 ; [L10530] unsigned long tmp___2 ; [L10531] int tmp___3 ; [L10532] long tmp___4 ; [L10533] long tmp___5 ; [L10535] EXPR f->private_data [L10535] n = (struct vhost_net *)f->private_data [L10536] argp = (void *)arg [L10537] featurep = (u64 *)argp [L10539] case 1074310960U: [L10547] case 2148052736U: [L10555] case 1074310912U: [L10567] case 44802U: [L10568] CALL vhost_net_reset_owner(n) [L10445] struct socket *tx_sock ; [L10446] struct socket *rx_sock ; [L10447] long err ; [L10449] tx_sock = 0 [L10450] rx_sock = 0 [L10451] CALL ldv_mutex_lock_66(& n->dev.mutex) [L10919] CALL ldv_mutex_lock_mutex(ldv_func_arg1) [L11361] COND TRUE ldv_mutex_mutex == 1 VAL [__this_module={0:0}, experimental_zcopytx=0, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=1, lock={36037739157848593:281474976694581}, lock={36037739157848593:281474976694581}, vhost_net_fops={215:0}, vhost_net_misc={216:0}, vhost_zcopy_mask=0] [L11365] ldv_mutex_mutex = 2 VAL [__this_module={0:0}, experimental_zcopytx=0, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=2, lock={36037739157848593:281474976694581}, lock={36037739157848593:281474976694581}, vhost_net_fops={215:0}, vhost_net_misc={216:0}, vhost_zcopy_mask=0] [L10919] RET ldv_mutex_lock_mutex(ldv_func_arg1) [L10920] FCALL mutex_lock(ldv_func_arg1) [L10451] RET ldv_mutex_lock_66(& n->dev.mutex) [L10452] CALL, EXPR vhost_dev_check_owner(& n->dev) [L6410] struct task_struct *tmp ; [L6412] CALL, EXPR get_current() [L5283] struct task_struct *pfo_ret__ ; [L5286] case 1UL: [L5289] case 2UL: [L5292] case 4UL: [L5295] case 8UL: VAL [__this_module={0:0}, experimental_zcopytx=0, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=2, vhost_net_fops={215:0}, vhost_net_misc={216:0}, vhost_zcopy_mask=0] [L5302] return (pfo_ret__); VAL [\result={162129586585337856:8}, __this_module={0:0}, experimental_zcopytx=0, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=2, pfo_ret__={162129586585337856:8}, vhost_net_fops={215:0}, vhost_net_misc={216:0}, vhost_zcopy_mask=0] [L6412] RET, EXPR get_current() [L6412] tmp = get_current() [L6413] EXPR dev->mm [L6413] EXPR tmp->mm VAL [__this_module={0:0}, dev={36037739157848593:281474976694565}, dev={36037739157848593:281474976694565}, dev->mm={72705206386688:10060393955196928}, experimental_zcopytx=0, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=2, tmp={162129586585337856:8}, tmp->mm={9570149208162304:562949953421312}, vhost_net_fops={215:0}, vhost_net_misc={216:0}, vhost_zcopy_mask=0] [L6413] EXPR (unsigned long )dev->mm == (unsigned long )tmp->mm ? 0L : -1L VAL [(unsigned long )dev->mm == (unsigned long )tmp->mm ? 0L : -1L=0, __this_module={0:0}, dev={36037739157848593:281474976694565}, dev={36037739157848593:281474976694565}, dev->mm={72705206386688:10060393955196928}, experimental_zcopytx=0, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=2, tmp={162129586585337856:8}, tmp->mm={9570149208162304:562949953421312}, vhost_net_fops={215:0}, vhost_net_misc={216:0}, vhost_zcopy_mask=0] [L6413] return ((unsigned long )dev->mm == (unsigned long )tmp->mm ? 0L : -1L); [L10452] RET, EXPR vhost_dev_check_owner(& n->dev) [L10452] err = vhost_dev_check_owner(& n->dev) [L10453] COND FALSE !(err != 0L) [L10457] CALL vhost_net_stop(n, & tx_sock, & rx_sock) [L10183] CALL vhost_net_stop_vq(n, (struct vhost_virtqueue *)(& n->vqs) + 1UL) [L10155] struct socket *sock ; [L10156] bool __warned ; [L10157] int tmp ; [L10158] int tmp___0 ; [L10160] CALL ldv_mutex_lock_56(& vq->mutex) [L10839] CALL ldv_mutex_lock_mutex(ldv_func_arg1) [L11361] COND FALSE !(ldv_mutex_mutex == 1) [L11363] CALL ldv_error() [L10992] reach_error() VAL [__this_module={0:0}, experimental_zcopytx=0, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=2, vhost_net_fops={215:0}, vhost_net_misc={216:0}, vhost_zcopy_mask=0] - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 10992]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 9232 locations, 78 error locations. Started 1 CEGAR loops. OverallTime: 30.1s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 52940 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 52932 mSDsluCounter, 124403 SdHoareTripleChecker+Invalid, 5.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50584 mSDsCounter, 521 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 733 IncrementalHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 521 mSolverCounterUnsat, 73819 mSDtfsCounter, 733 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 220 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12860occurred in iteration=5, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 6 MinimizatonAttempts, 8198 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 6.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 153 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 220 ConstructedInterpolants, 0 QuantifiedInterpolants, 455 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3510 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 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 [2021-11-22 21:44:42,627 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 Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample